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.
[[["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 `StronglyConnectedComponentsFinder` class in C++ is used to identify strongly connected components within a graph."],["It primarily uses the `FindStronglyConnectedComponents` method, taking the number of nodes and the graph as input, to compute and store the components in an `SccOutput` object."],["For advanced users, `NodeIsInCurrentDfsPath` provides a way to check the current state of the algorithm during execution."]]],[]]
