Support computations of vertex (and edge) connectivity of graph along with the vertex-(edge-) disjoint paths (Menger's theorem))

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 computations of vertex (and edge) connectivity of graph along with the vertex-(edge-) disjoint paths (Menger's theorem)) #198

Open lavkan opened 2 years ago

lavkan commented 2 years ago

Is your feature request related to a problem? Please describe. For a given pair of nodes (or node sets), I am trying to find the largest number of node disjoint paths between them. This is equal to the size of the min cut size that separates the two node (sets) - Menger's theorem https://en.wikipedia.org/wiki/Menger%27s_theorem

Describe the solution you would like