luke
/
verilator
mirror of https://github.com/verilator/verilator.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Commentary

This commit is contained in:
Geza Lore 2022-09-28 14:41:26 +01:00
parent 75a70bee6d
commit a999c73ce0
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
src/V3GraphAlg.cpp
View File

@ -178,7 +178,10 @@ private:
std::vector<V3GraphVertex*> m_callTrace; // List of everything we hit processing so far std::vector<V3GraphVertex*> m_callTrace; // List of everything we hit processing so far
void main() { void main() {
// Use Tarjan's algorithm to find the strongly connected subgraphs. // Use Pearce's algorithm to color the strongly connected components. For reference see
// "An Improved Algorithm for Finding the Strongly Connected Components of a Directed
// Graph", David J.Pearce, 2005
//
// Node State: // Node State:
// Vertex::user // DFS number indicating possible root of subtree, 0=not iterated // Vertex::user // DFS number indicating possible root of subtree, 0=not iterated
// Vertex::color // Output subtree number (fully processed) // Vertex::color // Output subtree number (fully processed)