| 91 | } |
| 92 | |
| 93 | void nested_dissection::recurse_dissection(PartitionConfig &config, graph_access &G, PartitionID block, NodeID &order_begin) { |
| 94 | std::vector<NodeID> mapping; |
| 95 | graph_extractor extractor; |
| 96 | graph_access subgraph; |
| 97 | extractor.extract_block(G, subgraph, block, mapping); |
| 98 | nested_dissection dissection(&subgraph, m_recursion_level + 1); |
| 99 | dissection.perform_nested_dissection(config); |
| 100 | |
| 101 | // Transfer labels from the subgraph to the reduced graph |
| 102 | for (size_t i = 0; i < mapping.size(); ++i) { |
| 103 | m_reduced_label[mapping[i]] = dissection.m_label[i] + order_begin; |
| 104 | } |
| 105 | order_begin += mapping.size(); |
| 106 | } |
| 107 | |
| 108 | const std::vector<NodeID>& nested_dissection::ordering() const { |
| 109 | return m_label; |
nothing calls this directly
no test coverage detected