[Lemon-user] k-node-connectivity

[Martin]

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 biNodeConnected to check whether a graph
is 2-node-connected so far.

Thanks,
Martin