问题及代码:
头文件graph.h和源文件graph.cpp代码详见图的算法库
测试图如下:
主函数main.cpp代码:
- #include <stdio.h>
- #include <malloc.h>
- #include "graph.h"
-
- void TopSort(ALGraph *G)
- {
- int i,j;
- int St[MAXV],top=-1;
- ArcNode *p;
- for (i=0; i<G->n; i++)
- G->adjlist[i].count=0;
- for (i=0; i<G->n; i++)
- {
- p=G->adjlist[i].firstarc;
- while (p!=NULL)
- {
- G->adjlist[p->adjvex].count++;
- p=p->nextarc;
- }
- }
- for (i=0; i<G->n; i++)
- if (G->adjlist[i].count==0)
- {
- top++;
- St[top]=i;
- }
- while (top>-1)
- {
- i=St[top];
- top--;
- printf("%d ",i);
- p=G->adjlist[i].firstarc;
- while (p!=NULL)
- {
- j=p->adjvex;
- G->adjlist[j].count--;
- if (G->adjlist[j].count==0)
- {
- top++;
- St[top]=j;
- }
- p=p->nextarc;
- }
- }
- }
-
- int main()
- {
- ALGraph *G;
- int A[7][7]=
- {
- {0,0,1,0,0,0,0},
- {0,0,0,1,1,0,1},
- {0,0,0,1,0,0,0},
- {0,0,0,0,1,1,0},
- {0,0,0,0,0,0,0},
- {0,0,0,0,0,0,0},
- {0,0,0,0,0,1,0}
- };
- ArrayToList(A[0], 7, G);
- DispAdj(G);
- printf("\n");
- printf("拓扑序列:");
- TopSort(G);
- printf("\n");
- return 0;
- }
运算结果:
知识点总结:
拓扑排序算法,如果边<Vi,Vj>是图的边即从顶点Vi到顶点Vj有一条路径,则在序列中顶点Vi必须排在顶点Vj的前面。
学习心得:
经过看视频和课上练习已经掌握了此种方法。