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

[lavkan]

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]

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 #198

Thanks,
LG