count diconnected components Algorithm

In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimal number of components (nodes or edges) that necessitate to be removed to separate the remaining nodes into isolated subgraphs. It is closely related to the theory of network flow problems.

count diconnected components source code, pseudocode and analysis