| 19 | } |
| 20 | |
| 21 | int strongly_connected_components::strong_components( graph_access & G, std::vector<int> & comp_num) { |
| 22 | |
| 23 | m_dfsnum.resize(G.number_of_nodes()); |
| 24 | m_comp_num.resize(G.number_of_nodes()); |
| 25 | m_dfscount = 0; |
| 26 | m_comp_count = 0; |
| 27 | |
| 28 | forall_nodes(G, node) { |
| 29 | //comp_num[node] = -1; |
| 30 | m_comp_num[node] = -1; |
| 31 | m_dfsnum[node] = -1; |
| 32 | } endfor |
| 33 | |
| 34 | forall_nodes(G, node) { |
| 35 | if(m_dfsnum[node] == -1) { |
| 36 | explicit_scc_dfs(node, G); |
| 37 | } |
| 38 | } endfor |
| 39 | |
| 40 | forall_nodes(G, node) { |
| 41 | comp_num[node] = m_comp_num[node]; |
| 42 | } endfor |
| 43 | |
| 44 | return m_comp_count; |
| 45 | } |
| 46 | |
| 47 | void strongly_connected_components::explicit_scc_dfs(NodeID node, graph_access & G){ |
| 48 |
no test coverage detected