22 namespace BoostGraphOrdering
28 bool reverse =
false);
33 const std::set<std::pair<std::size_t, std::size_t>>& edges,
34 std::size_t size,
bool reverse =
false);
This class provides a static adjacency list data structure. It is commonly used to store directed gra...
Definition: AdjacencyList.h:28
std::vector< int > compute_cuthill_mckee(const AdjacencyList< std::int32_t > &graph, bool reverse=false)
Compute re-ordering (map[old] -> new) using Cuthill-McKee algorithm.
Definition: BoostGraphOrdering.cpp:49
Graph data structures and algorithms.
Definition: AdjacencyList.h:18