00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029 #ifndef GLGRAPH_INCLUDED
00030 #define GLGRAPH_INCLUDED
00031
00032 #include "gllist.h"
00033 #include "gldynarray.h"
00034 #include "glinsidelist.h"
00035 #include "glcirclelist.h"
00036
00037
00038
00039
00040
00041 class GlGraph
00042 {
00043 public:
00044
00045 GlGraph( int numVertex );
00046 ~GlGraph();
00047
00051 void AddBiEdge( int source, int dest, int length );
00052
00056 void AddBiEdge( int source, int dest, int lengthSourceToDest, int lengthDestToSource );
00057
00061 void AddEdge( int source, int dest, int length );
00062
00068 void GetPath( int source, int dest, int *nextVertex, int* length, int *distance );
00069
00070 #ifdef DEBUG
00071 void DumpVertex();
00072 #endif
00073
00074 private:
00075 struct DataPoint
00076 {
00077 int distance;
00078 int vertex;
00079 };
00080
00081 struct Edge
00082 {
00083 int lengthTo;
00084 int lengthFrom;
00085 int toVertex;
00086
00087 bool operator==( const Edge& rhs ) { return lengthTo == rhs.lengthTo && lengthFrom == rhs.lengthFrom && toVertex == rhs.toVertex; }
00088 };
00089
00090 struct Vertex
00091 {
00092 Vertex() : destinationCalculated( false ) {}
00093
00094 bool destinationCalculated;
00095 GlSList< Edge > edgeList;
00096 };
00097
00098 void LowerAddEdge( int v0, int v1, int length0to1, int length1to0 );
00099 void ShortestPathCalc( int destVertex );
00100 DataPoint* GetDataPoint( int source, int dest ) { return ( dataPoint + dest * numVertex + source ); }
00101 int FindCheapest( GlCircleList<int>* set, int dest );
00102
00103 enum {
00104 GL_INFINITE = 0x1000000
00105 };
00106
00107 int numVertex;
00108 Vertex *vertex;
00109 DataPoint *dataPoint;
00110 };
00111
00112
00113 #endif
00114
00115