C++ Reference: eulerian_path

This documentation is automatically generated.

Utility to build Eulerian paths and tours on a graph. For more information, see https://en.wikipedia.org/wiki/Eulerian_path. As of 10/2015, only undirected graphs are supported.

Usage:
   - Building an Eulerian tour on a ReverseArcListGraph:
   ReverseArcListGraph<int, int> graph;
   // Fill graph
   std::vector<int> tour = BuildEulerianTour(graph);


   - Building an Eulerian path on a ReverseArcListGraph:
   ReverseArcListGraph<int, int> graph;
   // Fill graph
   std::vector<int> tour = BuildEulerianPath(graph);

Function Type Arguments Comments
BuildEulerianPath

Return type: std::vector<typename Graph::NodeIndex>

Arguments: const Graph& graph

BuildEulerianPathFromNode

Return type: std::vector<NodeIndex>

Arguments: const Graph& graph, NodeIndex root

BuildEulerianTour

Return type: std::vector<typename Graph::NodeIndex>

Arguments: const Graph& graph

BuildEulerianTourFromNode

Return type: std::vector<NodeIndex>

Arguments: const Graph& graph, NodeIndex root

IsEulerianGraph

Return type: bool

Arguments: const Graph& graph

IsSemiEulerianGraph

Return type: bool

Arguments: const Graph& graph, std::vector<NodeIndex>* odd_nodes