| 14 | #include "node_ordering/ordering_tools.h" |
| 15 | |
| 16 | void print_ordering(std::ostream &out, const std::vector<NodeID> &labels) { |
| 17 | out << labels.size() << std::endl; |
| 18 | for (size_t i = 0; i < labels.size(); ++i) { |
| 19 | out << (i + 1) << "\t" << (labels[i] + 1) << std::endl; |
| 20 | } |
| 21 | } |
| 22 | |
| 23 | NodeWeight compute_reachable_set_size(graph_access &graph, NodeID node) { |
| 24 | NodeWeight result = graph.getNodeWeight(node) - 1; |