On Tue, 3 Apr 2012, Martin wrote:

Hi,

does anybody know a function to get the k-node-connectivity (k-vertex-connectivity) of a digraph (or graph)? (http://en.wikipedia.org/wiki/K-vertex-connected_graph) I could only find the function biconnected_components so far.

I do not believe there is one in Boost.Graph. Contributions are always appreciated, however. -- Jeremiah Willcock