feat: shortests paths

README.md

@@ -5,7 +5,8 @@ processing capabilities on top of DataFusion's DataFrame API.
 
 ## About
 
-This project aims to bring the power of GraphFrames to the Apache DataFusion ecosystem by leveraging DataFrame capabilities.
+This project aims to bring the power of GraphFrames to the Apache DataFusion ecosystem by leveraging DataFrame
+capabilities.
 It provides a similar API to Apache Spark's GraphFrames.
 
 ## Project Status
@@ -20,8 +21,8 @@ and Pregel API.
 | Graph Abstraction               | ✓           | ✓              |
 | Basic Statistics (degree, etc.) | ✓           | ✓              |
 | Pregel API                      | ✓           | ✓              |
-| Shortest Paths                  | ✓           | In Progress    |
-| PageRank                        | ✓           | Planned        |
+| Shortest Paths                  | ✓           | ✓              |
+| PageRank                        | ✓           | ✓              |
 | Parallel Personalized PageRank  | ✓           | Planned        |
 | Connected Components            | ✓           | Planned        |
 | Strongly Connected Components   | ✓           | Planned        |

src/lib.rs

@@ -1,5 +1,6 @@
 mod pagerank;
 mod pregel;
+mod shortest_paths;
 
 use datafusion::error::Result;
 use datafusion::functions_aggregate::count::count;

src/pregel.rs

@@ -314,7 +314,10 @@ impl PregelBuilder {
             // are not participating in iteration.
             if self.participation_column.is_some() {
                 let participation_column = self.participation_column.as_ref().unwrap();
-                triplets = triplets.filter(pregel_src(&participation_column.name))?
+                triplets = triplets.filter(
+                    pregel_src(&participation_column.name)
+                        .or(pregel_dst(&participation_column.name)),
+                )?;
             }
 
             // Unfortunately, "unnest" does not allow passing to it an array of expression;