搜索资源列表
test8
- 用邻接链表结构存储图。程序首先调用建立有向图邻接链表的算法,建立有向图的邻接链表,在此邻接链表结构上,实现对有向图的拓扑排序,并输出结果。-Structure storage figure
Program-of-gram
- 图的创建、遍历、最小生成树、最短路径、拓扑排序、关键路径-create ,travase,spaning tree,the shortest path,topological sort program of graph
houzi
- 猴子选大王,多项式计算拓扑排序,C语言编写的数据库实验-The Monkey King of choose, polynomial topological sort calculation
topSort
- 拓扑排序的两种实现 拓扑排序的两种实现- Topological sorting Topological sorting Topological sorting
tuopu
- 经典拓扑排序算法,输入aov网络显示各节点入度出度,及邻接矩阵,并输出拓扑序列-topological sort arithmetic
vx
- 算法——拓扑排序算法,即由某个集合上的一个偏序得到该集合上的一个全序。-algorithm-- Topological Sorting Algorithm that is a set of a partial order set to get the a full order
better
- 给出一棵树,找出这棵树中所有的拓扑排序列表,并列出来-Give a tree, find out the tree of all the topological sort list, tied for it
graphclaim
- 本源码实现了图的基本操作。BFS,DFS,邻接矩阵,邻接链表,矩阵变换,拓扑排序等。-This code is about Basic opereation of Graph.Such as BFS,DFS,adjacent-matrix/list matrixing and topical sort etc.
main
- 图的深度优先搜索和广度优先搜索以及一个无向图的拓扑排序-Graph depth-first search and breadth-first search and topological sorting of a directed graph
cnmbd
- 计算工程完成的关键路径 说明: AOE 网络是有向无环加权图,其中顶点表示事件,弧表示活动,权表示活动持续的时间,通常可以用来估算工程完成的时间,即图中从开始点到结束点之间最长的路径对应的时间。请完成一个程序,完成下列任务: 1 、计算 AOE 网络对应的拓扑排序。如果排序结果不唯一,请输出按照从小到大的顺序排列的结果。从小到大的顺序就是输入的节点序列顺序(参见下面关于输入格式的说明)。如图1中满足要求的拓扑排序是: a-b-c-d-e-f-g-h-k ,图2中满足要求的拓扑排序
TUOPUPAIXU
- 图论中的拓扑排序问题可以用来解决图中的回路问题。-Topological sort problem in graph theory can be used to solve the circuit in Figure.
1
- 建无向图,求每个顶点的度,有向网的创建。拓扑排序。-not to create maps for each of the vertex, is to create the network. Topological sorting.
TopologicalSort
- c++语言实现拓扑排序。由中山大学软件工程大一下学期编写-c++ language topological sort. Written by Sun Yat-sen University Software Engineering semester
Topological-sort
- 拓扑排序,已知一个有向网,求网的一个拓扑排序,并给出这个有向图代表的工程能否进行-Topological sort, known a have to nets, and a network of topological sort, and give the directed graph represent can project
AOV
- 数据结构AOV拓扑排序,算法简单易用,适合初学者-Data structure AOV topological sort algorithm is simple and easy to use, suitable for beginners
C-tuopu
- 该文件能实现拓扑排序算法, 一链表为数据存储的容器-The file to the topological sorting algorithm, a linked list for data storage container
keypath
- 输入有向图的所有顶点和每条边的端点和权值,可以对该图进行拓扑排序并得出关键路径-you can input the point and the weight of each way of a directed graph so that you can get critical path
paike-(2)
- 拓扑排序实现智能排课系统,可实现简单的排课功能-Topological sort intelligent arrangement system
Data-structure
- 数据结构课程设计 包括单链表,二叉树,拓扑排序,最小生成树,内部排序,表达式求值-The data structure curriculum includes the singly linked lists, binary trees, topological sort, minimum spanning tree, internal sequencing, expression evaluation
Topological-sort
- 代码的功能:用C语言仿真有向图的拓扑排序,代码中带有详细的注解,十分有利于阅读。拓扑排序算法是有向图的应用领域中的一种重要算法,阐述了AOV图的定义及拓扑排序算法思想。 -Functionality of the code: a directed graph topological sort in C language simulation code with detailed comments, very conducive to reading. The topological sort