| 149 | } |
| 150 | |
| 151 | std::vector<CompressedNodeBasedGraphEdge> toEdgeList(const util::NodeBasedDynamicGraph &graph) |
| 152 | { |
| 153 | std::vector<CompressedNodeBasedGraphEdge> edges; |
| 154 | edges.reserve(graph.GetNumberOfEdges()); |
| 155 | |
| 156 | // For all nodes iterate over its edges and dump (from, to) pairs |
| 157 | for (const NodeID from_node : util::irange(0u, graph.GetNumberOfNodes())) |
| 158 | { |
| 159 | for (const EdgeID edge : graph.GetAdjacentEdgeRange(from_node)) |
| 160 | { |
| 161 | const auto to_node = graph.GetTarget(edge); |
| 162 | |
| 163 | edges.push_back({from_node, to_node}); |
| 164 | } |
| 165 | } |
| 166 | |
| 167 | return edges; |
| 168 | } |
| 169 | } // namespace |
| 170 | |
| 171 | /** |
no test coverage detected