搜索资源列表
t(OK)
- 该程序实现了图的先序、后序遍历和拓扑排序等,而且是界面输出。-the program to achieve the plan's first sequence, after the preorder and topological sorting, but it is the output interface.
GreedyTP
- 同学做的基于贪婪策略的拓扑排序算法可视化演示程序,支持用户自己画出拓扑图,VC++.net下测试通过。-students so greedy strategy based on the topological sorting algorithm visualization demo program that allows users to draw their own topology map, VC. Net under test.
Followingclassifications
- 关于拓扑排序的算法,里边有一些相应的注释。-on topological sorting algorithm, along with some of the Notes.
xiaoliang1tuopu
- t拓扑排序 输入 顶点数 边数..... 进行拓扑排序-not topological sorting input vertices edge topology ranking
拓扑排序
- 一个拓扑排序的算法-a topological sorting algorithm
sort
- 课程安排,用拓扑排序实现,大家可以看一下
tupo
- 简单的拓扑排序示例,是初学者对此结构编程进行深入了解的典型例题,很有帮助.
tuopupaixu
- 拓扑排序,VC能够通过,没错误!而且也比较好!
Course
- 一个用java写的基于拓扑排序的排课系统
TopologicalSort
- 用C#编写的拓扑排序算法程序(数据结构) 本程序用到了Framework 2.0 里新增的泛型, 代码简洁,且容易理解。
hj
- 图的算法实现 (1)将图的信息建立文件; (2)从文件读入图的信息,建立邻接矩阵和邻接表; (3)实现Prim、Kruskal、Dijkstra和拓扑排序算法。
拓扑排序3
- 拓扑排序 好的VC程序-topological sorting good VC Program
关键路径算法
- 运行程序后!由于为了测试方便,AOE网初始化,所以,运行程序后,即可得到结果,结果包括拓扑排序和关键路径。-operating procedures! In order to facilitate the testing because, AOE network initialization, and operating procedures, can be obtained results include topological sorting and Critical Path.
拓扑排序.实验4
- 这是一个拓扑排序的例子,对学数据结构的同学有很大帮助!-This is a topological sorting example, the data structure of the students will have a great help!
algo & data structures graphs
- 图的遍历:图是由顶点集合(vertex)及顶点间的关系集合组成的一种数据结构:Graph=( V, E ).使用拓扑排序的算法.-traverse the map : The map is set by the vertex (Vertex) and the relationship between peak set consisting of a data structure : Graph = (V, E). The use of topological sorting algorithm.
topologicalorder
- 本程序用VC++实现有向图,无向图,有向网,无向网的拓扑排序-This program with VC++ to achieve a directed graph, undirected graph, a directed network, the network topology without sorting
Graph
- 创建有向图的邻接表,在此临界表的基础上进行拓扑排序-Create a directed graph adjacency table, the table in this critical topological sort on the basis of
graph_
- //有向图:有向图,无向图基本操作 //运行环境:VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径(Dijkstra,Floyd两种算法)-//Directed graph: directed graph, undirected graph basic operation// Operating Environme
TopSort
- 图的拓扑排序。采用邻接表存储结构。其中包含有栈的操作。-Map topological sort. The use of the adjacent table storage structure. Which contains a stack operation.
Crosstopology111
- 多边形拓扑关系的建立 多边形拓扑关系建立要考虑的要素有点、线、面与它们之间的关系,本文通过适当的步骤建立点、线、面之间的关系,得到各要素之间邻接表关系,并且本文提出了一种新的方法来确定同一节点中弧段的排序问题,通过有向弧的方向性简化多边形搜索过程,最后进行了编程实现和实例分析。(The establishment of polygon topological relation)