Go to the source code of this file.
|
| operations_research |
| The vehicle routing library lets one model and solve generic vehicle routing problems ranging from the Traveling Salesman Problem to more complex problems such as the Capacitated Vehicle Routing Problem with Time Windows.
|
|
|
template<typename Graph > |
bool | IsEulerianGraph (const Graph &graph) |
|
template<typename NodeIndex , typename Graph > |
bool | IsSemiEulerianGraph (const Graph &graph, std::vector< NodeIndex > *odd_nodes) |
|
template<typename NodeIndex , typename Graph > |
std::vector< NodeIndex > | BuildEulerianPathFromNode (const Graph &graph, NodeIndex root) |
|
template<typename NodeIndex , typename Graph > |
std::vector< NodeIndex > | BuildEulerianTourFromNode (const Graph &graph, NodeIndex root) |
|
template<typename Graph > |
std::vector< typename Graph::NodeIndex > | BuildEulerianTour (const Graph &graph) |
|
template<typename Graph > |
std::vector< typename Graph::NodeIndex > | BuildEulerianPath (const Graph &graph) |
|