Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class StronglyConnectedComponentsFinder
Note: This documentation is automatically generated.
| Method |
FindStronglyConnectedComponents | Return type: void Arguments: const NodeIndex num_nodes,
const Graph& graph,
SccOutput* components |
NodeIsInCurrentDfsPath | Return type: bool Arguments: NodeIndex node Advanced usage. This can be used in either the Graph or SccOutput template
class to query the current state of the algorithm. It allows to build more
complex variant based on the core DFS algo.
|
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[],["The `StronglyConnectedComponentsFinder` class in C++ offers methods for graph analysis. The primary method, `FindStronglyConnectedComponents`, identifies strongly connected components within a graph using the provided `num_nodes`, `graph`, and an output `components` object. `NodeIsInCurrentDfsPath` is an advanced method, enabling queries about the algorithm's current state by checking if a specific `node` is within the current depth-first search path.\n"],null,[]]
