C++ Reference: connectivity
This documentation is automatically generated.Graph connectivity algorithm for undirected graphs. Memory consumption: O(n) where m is the number of arcs and n the number of nodes. TODO(user): add depth-first-search based connectivity for directed graphs. TODO(user): add depth-first-search based biconnectivity for directed graphs.