Graph class (directed)
More...
#include <Graph.h>
List of all members.
Detailed Description
Constructor & Destructor Documentation
Constructor.
- Parameters:
-
[in] | sName | Resource name to set |
[in] | pManager | Resource manager using this resource, can be a null pointer |
Member Function Documentation
Returns the shortest path from a node to another.
- Parameters:
-
[in] | nStartNode | Start node |
[in] | nEndNode | End node |
- Returns:
- The shortest path from the start node to the end node, a null pointer if no such path exist. (you have do delete this path by yourself!)
- Note:
- Dijkstra's single source shortest path algorithm is used
virtual PLMATH_API Graph& PLMath::Graph::operator= |
( |
const Graph & |
cSource | ) |
[virtual] |
Unloads the loadable.
- Returns:
- 'true' if all went fine, else 'false'
Reimplemented from PLCore::Loadable.
Returns the loadable type name.
- Returns:
- The loadable type name
Reimplemented from PLCore::Loadable.
The documentation for this class was generated from the following file: