25 bool reverse =
false);
30 const std::set<std::pair<std::size_t, std::size_t>>& edges,
31 std::size_t size,
bool reverse =
false);
Graph data structures and algorithms.
Definition: AdjacencyList.h:19
std::vector< int > compute_cuthill_mckee(const AdjacencyList< std::int32_t > &graph, bool reverse=false)
This class computes graph re-orderings. It uses Boost Graph.
Definition: boostordering.cpp:46