搜索资源列表
TTU
- 《数据结构》课程设计 建立并显示出有向图的邻接链表； 对该图进行拓扑排序，显示拓扑排序的结果，并随时显示入度域的变化情况； 给出它的关键路径（要求：显示出VE,VL,E,L,L-E的结果）。-" Data Structure" Course Design has established and demonstrated to the adjacency list the topological sort graph shows the results of top
Topology
- 1用邻接表作为图的存储结构； 2用非递归的方法实现拓扑排序；-A map with the adjacency table as the storage structure two ways to achieve a non-recursive topological sorting
TopSort
- java语言实现图的拓扑排序，图利用vector来存储-java language map of topological sorting, graph used to store vector
TOPO
- 拓扑排序-topological sorting
tuopupaixu
- 拓扑排序，随机的给出一个图，通过此算法可以获得该图的拓扑排序的结果-Topological sorting, random given a map, get through this algorithm to sort the results of the topological map
1
- 给定一个有向图，实现图的深度优先, 广度优先遍历算法，拓扑有序序列，并输出相关结果。 功能要求：输入图的基本信息，并建立图存储结构（有相应提示），输出遍历序列，然后进行拓扑排序，并测试该图是否为有向无环图，并输出拓扑序列-Given a directed graph, realize the depth chart first, breadth-first traversal algorithm, topology and orderly sequence, and outputs the
topological
- 拓扑排序，实现邻接表输出，最后输出正确的拓扑序列-Topological sort, the adjacent table to achieve the output, the final output of the correct topological sequence
topologywaytoarrangecourses
- 用拓扑排序实现对学生整个大学学期内的课程的自动安排-a easy fuction to arrange the courses of student
topological
- 大学二年级 拥有3个方法采用拓扑排序来实现排课 课程设计-Topological Sort Arranging Course Design
method1
- 运用拓扑排序，能够从文件中读取课程信息，并根据那些信息自动生成课表文件-The use of topological sort, able to read the course information from the file and, based on that information automatically generated curriculum documents
kechengsheji
- 课程排序，根据计算机系的课程进行拓扑排序，先修哪一门课先，之后再修哪一门课-Course scheduling, curriculum based computing in topological sort, which of course pre-start, which of course after revision
hfmdiguizuoye
- 数据结构哈弗曼算法的经典实现，还有递归跟非递归的,拓扑排序等1-Data structure algorithms Classical Havermann there with non-recursive recursive, topological sorting, etc. 1
lab
- matlab进行拓扑排序的程序，在matlab中实现了拓扑排序算法。-matlab for topological sort of the process is implemented in matlab a topological sorting algorithm.
keypath
- 求解关键路径 通过拓扑排序，求出一个工程的拓扑序列，送到一个栈中，在逆序输出-key path
BBB
- 设有一个有向图存储在邻接表中。试设计一个算法，按深度优先搜索策略对其进行拓扑排序。并以右图为例检验你的算法的正确性。-There is a directed graph stored in the adjacent table. Trial design an algorithm, depth-first search strategy by the topology of its sort. And to test your example picture on the right algor
Topological_sort_information_data_structure_tutori
- 数据结构教程拓扑排序资料Topological sort information data structure tutorial -Data structure tutorial topological sorting information Topological sort information data structure tutorial
topological_sorting
- 拓扑排序 各种操作 c++ 实现的 数据结构 严蔚敏 -Topological sort c++ implementation of various operations of data structures Yan Wei Min
src
- 一个拓扑排序程序，简单、容易，且内有详细说明。保证你可以轻松的明白、理解。-A topological sorting procedure, simple, easy, and there are detailed. Guarantee that you can easily understand, understand.
Hel
- 数据结构中的拓扑排序，用拓扑排序来完成大学四年的课表排序，从文本文档中读取课程（乱序）课时，序号等信息，根据先修后修的原定顺序，按照拓扑排序来完成课表。-topo assessment in structure of computer,to finish the timetable for the whole four years at colleage. Read information from a text,an the number of the subjects and the m
Schedule
- 拓扑排序------打印输出计算机本科专业4年每学期的课表 1.采用C++实现。 2.熟练掌握图的应用。 3.熟练掌握图的邻接表存储结构以及拓扑排序的基本思想。 4.上机调试程序,掌握查错、排错使程序能正确运行。 5.算法提示：拓扑排序用队列存储入度为零的顶点-Computer printout of topological sorting------ 4-year undergraduate curriculum of each semester 1. Using C++