Send feedback
Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class StronglyConnectedComponentsFinder
Note: This documentation is automatically generated.
Method
FindStronglyConnectedComponentsReturn type: void
Arguments: const NodeIndex num_nodes,
const Graph& graph,
SccOutput* components
NodeIsInCurrentDfsPathReturn 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.
Send feedback
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 2022-09-14 UTC.
[{
"type": "thumb-down",
"id": "missingTheInformationINeed",
"label":"Missing the information I need"
},{
"type": "thumb-down",
"id": "tooComplicatedTooManySteps",
"label":"Too complicated / too many steps"
},{
"type": "thumb-down",
"id": "outOfDate",
"label":"Out of date"
},{
"type": "thumb-down",
"id": "samplesCodeIssue",
"label":"Samples / code issue"
},{
"type": "thumb-down",
"id": "otherDown",
"label":"Other"
}]
[{
"type": "thumb-up",
"id": "easyToUnderstand",
"label":"Easy to understand"
},{
"type": "thumb-up",
"id": "solvedMyProblem",
"label":"Solved my problem"
},{
"type": "thumb-up",
"id": "otherUp",
"label":"Other"
}]
Need to tell us more?
