[[["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."],[[["The `ConnectedComponents` class in C++ is used to analyze the connectivity of graphs."],["It provides methods to add nodes and edges to the graph, and to determine the connected components within the graph."],["Users can access information about the connected components, such as the representative node of a component and the total number of components."],["The class employs efficient algorithms to manage and analyze graph connectivity."]]],["The `ConnectedComponents` class in C++ provides methods for managing graph connectivity. Key actions include adding connections between nodes (`AddArc`), incorporating an entire graph (`AddGraph`), and merging equivalence classes of nodes (`MergeClasses`). The class can initialize data structures for a specified number of nodes (`Init`), and determine the representative of a node's equivalence class (`GetClassRepresentative`). It can also compute the total number of connected components (`GetNumberOfConnectedComponents`) and compress paths of a given node (`CompressPath`).\n"]]