search

neo4j / graph-data-science

Source code for the Neo4j Graph Data Science library of graph algorithms.
https://neo4j.com/docs/graph-data-science/current/
Other
597 stars 157 forks source link

Support connectivity algorithms (related to Ford-Fulkerson's algorithm) #190

Open lavkan opened 2 years ago

lavkan commented 2 years ago

Edge and vertex connectivity between two sets of vertices will have use cases to do with number of vertex or edge disjoint paths between the two sets (Menger's theorem).

https://reference.wolfram.com/language/ref/VertexConnectivity.html https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm

https://www.cse.msu.edu/~cse835/Papers/Graph_connectivity_revised.pdf https://www.cse.msu.edu/~cse835/Papers/Graph_connectivity_revised.pdf

Looking forward to see some algos related to connectivity.

Thanks, Lavanya

laeg commented 2 years ago

Hi Lavanya,

It was great to meet you last week at GraphConnect!

We've captured your request and we'll consider it for future release candidates. However, this will not be a 2.2 candidate.

We have also seen your other previous requests too for Menger's theorem https://github.com/neo4j/graph-data-science/issues/198

Thanks, LG