搜索资源列表
FigureandTree
- 数据结构：最小生成树拓扑排序图的邻接表及遍历关键路径二叉树遍历-Data structures: minimum spanning tree topology of the adjacent table to sort and map the critical path traversal binary tree traversal
newt
- 实现拓扑排序，用到了堆栈，存储结构采用邻接表。-To achieve topological sorting, use the stack, storage structure using adjacency list.
Graph
- 图的大部分实现 图的深度优先周游 图的广度优先周游 由队列方式实现的拓扑排序 由深度优先搜索方式实现的拓扑排序 单源最短路径(Dijkstra算法) 每对顶点之间的最短路径(Floyd算法) 最小支撑树(Prim算法) 最小支撑树(Kruskal算法)-Figure most of the implementation diagram of the depth-first breadth-first tour travel map be achieved by the topological s
4
- 用邻接表表示图的拓扑排序算法-failed to translate
graph
- 该压缩文件中包含了图论当中的一些重要算法，包括前序中序和后序遍历、最小二叉树、DFS、BFS以及拓扑排序。-The compressed file contains a graph theory among a number of important algorithms, including the former order in the order and postorder traversal, the smallest binary tree, DFS, BFS, and topolog
TopoLogical
- 检测一个有向图是否含有回路，并进行拓扑排序-Detection of a directed graph if it contains the loop and carry out topological sort
Schedule
- 拓扑排序--- 打印输出计算机本科专业4年每学期的课表-Computer printout of topological sorting------ 4-year undergraduate course per semester Timetable
Topo_logical_Order_7_12D
- 拓扑排序,并求关键路径.按UDG图的格式输入，程序创建UDG图，然后求关键活动，进行拓扑排序，最后将拓扑排序的结果输出。-Topological sort, and seek the critical path. By UDG graph format input, the program creates UDG chart, key activities and then seek to carry out topological sort, and finally output the re
graph.yangxu
- 熟悉图的存储方式，实现图的邻接矩阵或者邻接表的存储方式下的基本运算，特别是深度遍历和广度遍历；掌握以图为基础的一些常用算法，如最小生成树、拓扑排序、最短路径等。-Familiar with the map of storage practices, and achieve adjacency matrix or adjacency list is stored under the basic operations, especially in the depth and breadth trav
tuopu
- 简单的拓扑排序 在缩短工程周期中有很重要的运用-A simple topological sort in shortening project cycle there is a very important application of
zuiduanlujingtuopu
- 基于C++的数据结构的最短路径和拓扑排序算法-Based C++ data structure shortest path and topological sorting algorithms
B
- 拓扑排序问题的主干算法用以解决算法表达中的抽象机制问题-Topological sort algorithm to solve the problem of backbone to express algorithms in the abstract mechanism
Topological
- 数据结构中拓扑排序的c++实现,使用VisualC++开发-Topological sort of data structure c++ implementation, using VisualC++ Development
tutuopupaixu
- C语言版的数据结构，利用图的拓扑排序，实现C语言的拓扑排序。-C language version of the data structure, the use of graph topological sort to achieve C language, topological sort.
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
TOPO
- 拓扑排序-topological sorting
tuopupaixu
- 拓扑排序，随机的给出一个图，通过此算法可以获得该图的拓扑排序的结果-Topological sorting, random given a map, get through this algorithm to sort the results of the topological map
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