Menu
is there any pseudo-code implementation that shows how to compute the k-vertex connectivity of a graph?
271
A graph (other than a complete graph) has connectivity k if k is the size of the smallest subset of vertices such that the graph becomes disconnected if you delete them. Complete graphs are not included in this version of the definition since they cannot be disconnected by deleting vertices.
Vertex Connectivity Let 'G' be a connected graph. The minimum number of vertices whose removal makes 'G' either disconnected or reduces 'G' in to a trivial graph is called its vertex connectivity. In the above graph, removing the vertices 'e' and 'i' makes the graph disconnected. If G has a cut vertex, then K(G) = 1.
Thus, only the complete graphs have connectivity n−1. Any connected graph with at least two vertices can be disconnected by removing edges: by removing all edges incident with a single vertex the graph is disconnected. Thus, λ(G)≤δ(G), where δ(G) is the minimum degree of any vertex in G.
A graph is said to be connected graph if there is a path between every pair of vertex. From every vertex to any other vertex there must be some path to traverse. This is called the connectivity of a graph. A graph is said to be disconnected, if there exists multiple disconnected vertices and edges.
I can't post here the code from this book due to copyrights. But if you can get it, you will find not only you algorithm, but also lots of other good algorithms with codes.
180
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
