1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316
use crate::pregel::Column::{Custom, Object, Subject, VertexId};
use polars::prelude::*;
use std::fmt::{Debug, Display, Formatter};
use std::{error, fmt};
/// The `GraphFrame` type is a struct containing two `DataFrame` fields, `vertices`
/// and `edges`.
///
/// Properties:
///
/// * `vertices`: The `vertices` property is a `DataFrame` that represents the nodes
/// in a graph. It must contain a column named Id.
///
/// * `edges`: The `edges` property is a `DataFrame` that represents the edges of a
/// graph. It must contain -- at least -- two columns: Src and Dst.
#[derive(Clone)]
pub struct GraphFrame {
/// The `vertices` property is a `DataFrame` that represents the nodes in a graph.
pub vertices: DataFrame,
/// The `edges` property is a `DataFrame` that represents the edges of a graph.
pub edges: DataFrame,
}
/// A new type alias `Result<T>` that is equivalent to the
/// `std::result::Result<T, GraphFrameError>` type. This is a common pattern in
/// Rust to create a shorthand for a longer type name. The `Result<T>` type is used
/// throughout the `GraphFrame` struct to represent the result of a function that
/// can either return a value of type `T` or an error of type `GraphFrameError`.
type Result<T> = std::result::Result<T, GraphFrameError>;
/// `GraphFrameError` is an enum that represents the different types of errors that
/// can occur when working with a `GraphFrame`. It has three variants: `DuckDbError`,
/// `FromPolars` and `MissingColumn`.
#[derive(Debug)]
pub enum GraphFrameError {
/// `FromPolars` is a variant of `GraphFrameError` that represents errors that
/// occur when converting from a `PolarsError`.
FromPolars(PolarsError),
/// `MissingColumn` is a variant of `GraphFrameError` that represents errors that
/// occur when a required column is missing from a DataFrame.
MissingColumn(MissingColumnError),
}
/// This is an implementation of the `Display` trait for the `GraphFrameError` enum.
/// It allows instances of the `GraphFrameError` enum to be formatted as strings
/// when they need to be displayed to the user. The `fmt` method takes a mutable
/// reference to a `Formatter` object and returns a `fmt::Result`. It matches on the
/// enum variants and calls the `Display` trait's `fmt` method on the inner error
/// object to format the error message.
impl Display for GraphFrameError {
fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
match self {
GraphFrameError::FromPolars(error) => Display::fmt(error, f),
GraphFrameError::MissingColumn(error) => Display::fmt(error, f),
}
}
}
/// This is an implementation of the `Error` trait for a custom error type
/// `GraphFrameError`. It defines the `source` method which returns the underlying
/// cause of the error as an optional reference to a `dyn error::Error` trait
/// object. If the error is caused by a `FromPolars` error, it returns the reference
/// to the underlying error. If the error is caused by a missing column, it returns
/// `None`.
impl error::Error for GraphFrameError {
fn source(&self) -> Option<&(dyn error::Error + 'static)> {
match *self {
GraphFrameError::FromPolars(ref e) => Some(e),
GraphFrameError::MissingColumn(_) => None,
}
}
}
/// `MissingColumnError` is an enum that represents errors that occur when a
/// required column is missing from a DataFrame. The `Debug` trait allows for easy
/// debugging of the enum by printing its values in a formatted way.
#[derive(Debug)]
pub enum MissingColumnError {
/// `Id` is a variant of `MissingColumnError` that represents the error that
/// occurs when the `VertexId` column is missing from a DataFrame.
VertexId,
/// `Src` is a variant of `MissingColumnError` that represents the error that
/// occurs when the `Subject` column is missing from a DataFrame.
Subject,
/// `Dst` is a variant of `MissingColumnError` that represents the error that
/// occurs when the `Object` column is missing from a DataFrame.
Object,
}
impl Display for MissingColumnError {
fn fmt(&self, f: &mut Formatter) -> fmt::Result {
let message = |df, column: &str| format!("Missing column {} in {}", column, df);
match self {
MissingColumnError::VertexId => write!(f, "{}", message("vertices", VertexId.as_ref())),
MissingColumnError::Subject => write!(f, "{}", message("edges", Subject.as_ref())),
MissingColumnError::Object => write!(f, "{}", message("edges", Object.as_ref())),
}
}
}
impl From<PolarsError> for GraphFrameError {
fn from(err: PolarsError) -> GraphFrameError {
GraphFrameError::FromPolars(err)
}
}
impl GraphFrame {
/// The function creates a new GraphFrame object with given vertices and edges
/// DataFrames, checking for required columns.
///
/// Arguments:
///
/// * `vertices`: A DataFrame containing information about the vertices of the
/// graph, such as their IDs and attributes.
///
/// * `edges`: A DataFrame containing information about the edges in the graph. It
/// should have columns named "src" and "dst" to represent the source and
/// destination vertices of each edge.
///
/// Returns:
///
/// a `Result<Self>` where `Self` is the `GraphFrame` struct. The `Ok` variant of
/// the `Result` contains an instance of `GraphFrame` initialized with the provided
/// `vertices` and `edges` DataFrames. If any of the required columns (`Id`, `Src`,
/// `Dst`) are missing in the DataFrames, the function returns an `Error`.
pub fn new(vertices: DataFrame, edges: DataFrame) -> Result<Self> {
if !vertices.get_column_names().contains(&VertexId.as_ref()) {
return Err(GraphFrameError::MissingColumn(MissingColumnError::VertexId));
}
if !edges.get_column_names().contains(&Subject.as_ref()) {
return Err(GraphFrameError::MissingColumn(MissingColumnError::Subject));
}
if !edges.get_column_names().contains(&Object.as_ref()) {
return Err(GraphFrameError::MissingColumn(MissingColumnError::Object));
}
Ok(GraphFrame { vertices, edges })
}
/// This function creates a new `GraphFrame` from a given set of edges by selecting
/// source and destination vertices and concatenating them into a unique set of
/// vertices.
///
/// Arguments:
///
/// * `edges`: A DataFrame containing the edges of a graph, with at least two
/// columns named "src" and "dst" representing the source and destination vertices
/// of each edge.
///
/// Returns:
///
/// The `from_edges` function returns a `Result<Self>` where `Self` is the
/// `GraphFrame` struct.
pub fn from_edges(edges: DataFrame) -> Result<Self> {
let subjects = edges
.clone() // this is because cloning a DataFrame is cheap
.lazy()
.select([col(Subject.as_ref()).alias(VertexId.as_ref())]);
let objects = edges
.clone() // this is because cloning a DataFrame is cheap
.lazy()
.select([col(Object.as_ref()).alias(VertexId.as_ref())]);
let vertices = concat([subjects, objects], true, true)?
.unique(
Some(vec![VertexId.as_ref().to_string()]),
UniqueKeepStrategy::First,
)
.collect()?;
GraphFrame::new(vertices, edges)
}
/// This function calculates the out-degree of each node in a graph represented by
/// its edges. The out-degree of a node is defined as the number of out-going edges;
/// that is, edges that have as a source the actual node, and as a destination any
/// other node in a directed-graph.
///
/// Returns:
///
/// This function returns a `Result` containing a `DataFrame`. The `DataFrame`
/// contains the out-degree of each node in the graph represented by the `Graph`
/// object. The original `DataFrame` is preserved; that is, we extend it with
/// the out-degrees of each node.
pub fn out_degrees(self) -> PolarsResult<DataFrame> {
self.edges
.lazy()
.groupby([col(Subject.as_ref()).alias(VertexId.as_ref())])
.agg([count().alias(Custom("out_degree").as_ref())])
.collect()
}
/// This function calculates the in-degree of each node in a graph represented by
/// its edges. The out-degree of a node is defined as the number of incoming edges;
/// that is, edges that have as a source any node, and as a destination the node
/// itself in a directed-graph.
///
/// Returns:
///
/// This function returns a `Result` containing a `DataFrame`. The `DataFrame`
/// contains the in-degree of each node in the graph represented by the `Graph`
/// object. The original `DataFrame` is preserved; that is, we extend it with
/// the in-degrees of each node.
pub fn in_degrees(self) -> PolarsResult<DataFrame> {
self.edges
.lazy()
.groupby([col(Object.as_ref())])
.agg([count().alias(Custom("in_degree").as_ref())])
.collect()
}
}
/// This is the implementation of the `Display` trait for a `GraphFrame` struct.
/// This allows instances of the `GraphFrame` struct to be printed in a formatted
/// way using the `println!` macro or other formatting macros. The `fmt` method is
/// defined to format the output as a string that includes the vertices and edges of
/// the graph.
impl Display for GraphFrame {
fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
write!(
f,
"GraphFrame:\nVertices:\n{}\nEdges:\n{}",
self.vertices, self.edges
)
}
}
#[cfg(test)]
mod tests {
use crate::graph_frame::{GraphFrame, GraphFrameError};
use crate::pregel::Column;
use polars::prelude::*;
fn graph() -> Result<GraphFrame, GraphFrameError> {
let subjects = Series::new(Column::Subject.as_ref(), [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
let objects = Series::new(Column::Object.as_ref(), [2, 3, 4, 5, 6, 7, 8, 9, 10, 1]);
GraphFrame::from_edges(DataFrame::new(vec![subjects, objects]).unwrap())
}
#[test]
fn test_from_edges() {
let graph = graph().unwrap();
assert_eq!(graph.vertices.height(), 10);
assert_eq!(graph.edges.height(), 10);
}
#[test]
fn test_in_degree() {
let in_degree = graph().unwrap().in_degrees().unwrap();
assert_eq!(in_degree.height(), 10);
assert_eq!(
in_degree
.column("in_degree")
.unwrap()
.u32()
.unwrap()
.sum()
.unwrap(),
10
);
}
#[test]
fn test_out_degree() {
let out_degree = graph().unwrap().out_degrees().unwrap();
assert_eq!(out_degree.height(), 10);
assert_eq!(
out_degree
.column("out_degree")
.unwrap()
.u32()
.unwrap()
.sum()
.unwrap(),
10
);
}
#[test]
fn test_new_missing_vertex_id_column() {
let vertices = DataFrame::new(vec![Series::new("not_vertex_id", [1, 2, 3])]).unwrap();
let subjects = Series::new(Column::Subject.as_ref(), [1, 2, 3]);
let objects = Series::new(Column::Object.as_ref(), [2, 3, 4]);
let edges = DataFrame::new(vec![subjects, objects]).unwrap();
match GraphFrame::new(vertices, edges) {
Ok(_) => panic!("Should have failed"),
Err(e) => assert_eq!(e.to_string(), "Missing column vertex_id in vertices"),
}
}
#[test]
fn test_new_missing_subject_column() {
let vertices =
DataFrame::new(vec![Series::new(Column::VertexId.as_ref(), [1, 2, 3])]).unwrap();
let subjects = Series::new("not_src", [1, 2, 3]);
let objects = Series::new(Column::Object.as_ref(), [2, 3, 4]);
let edges = DataFrame::new(vec![subjects, objects]).unwrap();
match GraphFrame::new(vertices, edges) {
Ok(_) => panic!("Should have failed"),
Err(e) => assert_eq!(e.to_string(), "Missing column subject in edges"),
}
}
#[test]
fn test_new_missing_object_column() {
let vertices =
DataFrame::new(vec![Series::new(Column::VertexId.as_ref(), [1, 2, 3])]).unwrap();
let subjects = Series::new(Column::Subject.as_ref(), [1, 2, 3]);
let objects = Series::new("not_dst", [2, 3, 4]);
let edges = DataFrame::new(vec![subjects, objects]).unwrap();
match GraphFrame::new(vertices, edges) {
Ok(_) => panic!("Should have failed"),
Err(e) => assert_eq!(e.to_string(), "Missing column object in edges"),
}
}
}