Bpp/Graph_problem Shortest_path | C++ |
|  |
This module provides facilities to solve shortest path problems in graphs. This section allows you to access the C++ source files of the module. This module is part of Bpp/Graph_problem . The files listed below are included in the interface part of the module. So any module dependent of this module is also dependent of the files listed here. <algorithm>
<queue>
<bpp/graph.hpp>
The files listed below are needed by the implementation part of the module. But a module dependent of this module is not necessary dependent of the files listed here. The namespaces listed below are integrated in this module. That means any element declared in one of those namespaces can now be directly used by or from this module. The aliases listed below are only used internally by the interface. They are here just to lighten the writing of certain declarations. Never use them, they are local to the interface and can not be used outside of it. tdGraph = class prArcData,class prNodeData
tuGraph = prArcData,prNodeData
Here are listed the types defined in the module. To use one of them, you have to specify the namespace of the module. type clArc<clLengthData,clNoData> clLengthArc Arc of a graph with a path problem.
type clGraph<clLengthData,clNoData> clLengthGraph Graph with a path problem.
type clNode<clLengthData,clNoData> clLengthNode Node of a graph with a path problem.
Here are listed the errors that are supported or generated by the module. To use one of them, you do not have to specify the namespace of the module. Here are listed the functions provided by the module. To use one of them, you have to specify the namespace of the module. Here are listed the classes provided by the module. To use one of them, you have to specify the namespace of the module. template <tdGraph> class clBellmanAlgo : public clSolveAlgo<tuGraph>
Represents Bellman's algorithm to solve the shortest path problem between two nodes in a graph. The graph must have no directed cycle. template <tdGraph> class clDijkstraAlgo : public clSolveAlgo<tuGraph>
Represents Dijkstra's algorithm to solve the shortest path problem between two nodes in a graph. The arc lengths must be positive or zero. template <tdGraph> class clFordAlgo : public clSolveAlgo<tuGraph>
Represents Bellman & Ford's algorithm to solve the shortest path problem between two nodes in a graph. The graph must have no negative cycle. template <tdGraph> class clSolveAlgo
Represents an algorithm to solve the shortest path problem between two nodes in a graph. It is an abstract class. | | Copyright (c) 1999-2016 - Bruno Bachelet - bruno@nawouak.net - http://www.nawouak.net | Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation. See this license for more details (http://www.gnu.org). |
|
| |