A Graph=(V,E) and is a central data structure for numerous algorithms. More...
#include <limits>
#include <list>
#include <vector>
Go to the source code of this file.
Classes | |
| class | Graph |
| Graph superclass to define common interface for Graph objects and provide ability to load up from a file. More... | |
Typedefs | |
| typedef pair< int, int > | IntegerPair |
| typedef list< IntegerPair > | VertexList |
Enumerations | |
| enum | vertexColor { White, Gray, Black } |
| Types of vertes colorings used by the DepthFirst and BreadthFirst searches. More... | |
| enum | edgeType { Tree, Backward, Forward, Cross } |
| Types of computed edge types during DepthFirstSearch. More... | |
A Graph=(V,E) and is a central data structure for numerous algorithms.
Each edge (u,v) has a weight; if no edge weights are assigned then the default value of '1' is used.
| typedef pair<int,int> IntegerPair |
| typedef list<IntegerPair> VertexList |
| enum edgeType |
| enum vertexColor |
Algorithm Development Kit 1.0