C++ Reference
C++ Reference: Graph
util.h File Reference
Go to the source code of this file.
Classes | |
| class | UndirectedAdjacencyListsOfDirectedGraph< Graph > |
| class | UndirectedAdjacencyListsOfDirectedGraph< Graph >::AdjacencyListIterator |
Namespaces | |
| util | |
Functions | |
| template<class Graph > | |
| bool | GraphHasSelfArcs (const Graph &graph) |
| template<class Graph > | |
| bool | GraphHasDuplicateArcs (const Graph &graph) |
| template<class Graph > | |
| bool | GraphIsSymmetric (const Graph &graph) |
| template<class Graph > | |
| bool | GraphIsWeaklyConnected (const Graph &graph) |
| template<class Graph > | |
| std::unique_ptr< Graph > | CopyGraph (const Graph &graph) |
| template<class Graph > | |
| std::unique_ptr< Graph > | RemapGraph (const Graph &graph, const std::vector< int > &new_node_index) |
| template<class Graph > | |
| std::unique_ptr< Graph > | GetSubgraphOfNodes (const Graph &graph, const std::vector< int > &nodes) |
| template<class Graph > | |
| std::vector< int > | GetWeaklyConnectedComponents (const Graph &graph) |
| bool | IsSubsetOf0N (const std::vector< int > &v, int n) |
| bool | IsValidPermutation (const std::vector< int > &v) |
| template<class Graph > | |
| std::unique_ptr< Graph > | RemoveSelfArcsAndDuplicateArcs (const Graph &graph) |
| template<class Graph > | |
| void | RemoveCyclesFromPath (const Graph &graph, std::vector< int > *arc_path) |
| template<class Graph > | |
| bool | PathHasCycle (const Graph &graph, const std::vector< int > &arc_path) |
| template<class Graph > | |
| std::vector< int > | ComputeOnePossibleReverseArcMapping (const Graph &graph, bool die_if_not_symmetric) |