搜索资源列表
TopoSort
- 实现拓扑排序：一个有向无环图，表述为一个邻接矩阵graph[n][n]，其中graph[i][0]为顶点i的入度，其余为其后继结点。-The realization of topological sort: a directed acyclic graph, expressed as an adjacency matrix graph [n] [n], which graph [i] [0] for the vertex i of income, the remaining node to it
zong
- 这是数据结构c语言课本的几个常用算法代码。有广度和深度优先遍历。最小生成树，最短路径，拓扑排序。-This is the data structure of c language textbooks code of several commonly used algorithms. Have the breadth and depth-first traversal. Minimum spanning tree, shortest path, topological sort.
Topsort
- 所谓拓扑排序是指将顶点按照拓扑次序排列。有几种简单的算法可以求出一个图的拓扑次序。一种算法的思想如下： （1）在有向图中查找一个没有后继（或前驱）的顶点并添加到顶点表中。 （2）从图中删除该顶点和所有以该顶点为头（尾）的弧。 -The so-called topological sorting refers to the vertex order in accordance with the topology. There are several simple algor
CreateALGraph
- 拓扑排序问题 Csharp 算法 采用的方法是图的经典数据结构，若是有向无环图DAG则输出一个拓扑排序。若不是DAG则输出其中的一个环。-Topological sorting algorithm problem Csharp method is a classic graph data structure, if the directed acyclic graph DAG output is a topological sort. DAG if it is not one of the ou
Cpp5
- 拓扑排序 算法拓扑排序拓扑排序
suanfa
- 田径运动会赛程安排 利用拓扑排序 课程设计相关内容 含有 C++代码-good
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.