Stay organized with collections
Save and categorize content based on your preferences.
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.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["This documentation describes a graph connectivity algorithm specifically designed for undirected graphs with a memory consumption of O(n), where 'm' represents the number of arcs and 'n' denotes the number of nodes."],["Future implementations will include depth-first-search based connectivity and biconnectivity algorithms for directed graphs."],["The available class for utilizing this functionality is `ConnectedComponents`."]]],["The documentation describes a graph connectivity algorithm for undirected graphs in C++. It has a memory consumption of O(n), where n represents the number of nodes. The core functionality is implemented within the `ConnectedComponents` class. Future improvements will involve adding depth-first-search based connectivity and biconnectivity algorithms for directed graphs.\n"]]
