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."],[[["\u003cp\u003eThe \u003ccode\u003eStronglyConnectedComponentsFinder\u003c/code\u003e class in C++ is used to identify strongly connected components within a graph.\u003c/p\u003e\n"],["\u003cp\u003eIt primarily uses the \u003ccode\u003eFindStronglyConnectedComponents\u003c/code\u003e method, taking the number of nodes and the graph as input, to compute and store the components in an \u003ccode\u003eSccOutput\u003c/code\u003e object.\u003c/p\u003e\n"],["\u003cp\u003eFor advanced users, \u003ccode\u003eNodeIsInCurrentDfsPath\u003c/code\u003e provides a way to check the current state of the algorithm during execution.\u003c/p\u003e\n"]]],["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,[]]
