数据结构图的基本运算代码..docVIP

#includeiostream #includeLGraph.h #includeseqqueue.h #includeMGraph.h #define INFTY 1000 templateclass T struct ENode { ENode() {nextArc=NULL;} ENode(int vertex,T weight,ENode *next) { adjVex=vertex; w=weight; nextArc=next; } int adjVex; T w; ENode* nextArc; }; templateclass T class ExtLGraph:public LGraphT { public: ExtLGraph(int mSize):LGraphT(mSize){} void DFS(); void BFS(); void TopoSort(int *order); private: void CalInDegree(int *InDegree); void DFS(int v,bool *visited); void BFS(int v,bool *visited); }; templateclass T void ExtLGraphT::DFS() { bool *visited=new bool[n]; for(int i=0;in;i++) visited[i]=false; for(i=0;in;i++) if(!visited[i]) DFS(i,visited); delete []visited; } templateclass T void ExtLGraphT::DFS(int v,bool *visited) { visited[v]=true; cout v; for(ENodeT *t=a[v];t;t=t-nextArc) if(!visited[t-adjVex]) DFS(t-adjVex,visited); } templateclass T void ExtLGraphT::BFS() { bool *visited=new bool[n]; for(int i=0;in;i++) visited[i]=false; for(i=0;in;i++) if(!visited[i]) BFS(i,visited); delete []visited; } templateclass T void ExtLGraphT::BFS(int v,bool *visited) { SeqQueueintq(Vertices()); visited[v]=true; cout v; q.EnQueue(v); while(!q.IsEmpty()) { q.Front(v); q.DeQueue(); for(ENodeT *t=a[v];t;t=t-nextArc) if(!visited[t-adjVex]){ visited[t-adjVex]=true; cout w-adjVex; } q.EnQueue(t-adjVex); } } templateclass T void ExtLGraphT::CalInDegree(int *InDegree) //计算所有顶点的入度 { for(int i=0;in;i++) InDegree[i]=0; for(i=0;in;i++) for(ENodeT* p=a[i];p;p=p-nextArc) InDegree[p-adjVex]++; } templateclass T void ExtLGraphT::TopoSort(int *order) { int *InDegree=new int[n]; int i,j,k,top=-1; CalInDegree(InDegree); for(i=0;in;i++) if(!InDegree[i]) { InDegree[i]=top; top=i; } for(i=0;in;i++) { if(top==-1) { coutHas cycle!endl; return; } else { j=top; top=InDegree[top]; order[i]=j; coutj ; for(ENodeT* p=a[j];p;p=p-nextArc){ k=p-adj