搜索资源列表
graghtuopu
- 图的拓扑排序,是无前趋的接点拓扑排序,数据结构实验的同学可以看看!-map of topological sorting, and there is no contact before becoming the topological sorting, data structure experiments students can see!
delphi
- 本例以由拓扑关系的arc/info 文件为数据源。其中a1,b1,c1是以fnode排序生成的数组,a1对应fnode,b1对应tnode,c1对应length,同样a2,b2,c2,是以tnode 生成的数组。Indexa1是对应某一起点与其相连的终点的个数,indexb1时对应某一终点与其相连的起点的个数,即其拓扑关系-length, the same a2, b2, c2, is based on an array of tnode generated. Indexa1 is a star
1
- 给定一个有向图,实现图的深度优先, 广度优先遍历算法,拓扑有序序列,并输出相关结果。 功能要求:输入图的基本信息,并建立图存储结构(有相应提示),输出遍历序列,然后进行拓扑排序,并测试该图是否为有向无环图,并输出拓扑序列-Given a directed graph, realize the depth chart first, breadth-first traversal algorithm, topology and orderly sequence, and outputs the
tuopupaixu
- 实现拓扑排序算法,可用于判断图中是否存在环-Achieve topological sorting algorithm to determine the existence of maps Central
Topological-sort
- 拓扑排序,我自己写的,感觉还可以,轻多多指教-Topological sort huh