搜索资源列表
tu
- C练习作业:图 深度遍历,广度遍历,最小生成树,拓扑排序-C Exercise job: Figure depth traversal, breadth traversal, minimum spanning tree, topological sort
tuopupaixu
- 此为拓扑排序算法,拓扑排序是网络中的确定逻辑先后顺序的一种算法,要求网络中没有回路-This is the topological sort algorithm, the network topology in order to determine the logical order of an algorithm that requires no loop network
zzzzzzzzzzzzz
- 经典的编程题目,程序员必须掌握的编程思想--拓扑排序-The classic topic of programming, the programmer must master programming ideas- topological sort
Topological-sort
- 这是图中的使用拓扑的方式,对图进行的排序,得到的拓扑排序方法。-This is the way of using topological graph, the graph of sorting, get topological sort method.
1
- 这是一个拓扑排序的程序,他可以对一个有向无环图进行排序-This is a topological sort of the process, he can be a directed acyclic graph to sort
tanxin
- 贪心算法,本章首先引入最优化的概念,然后介绍一种直观的问题求解方法:贪婪算法。最后,应用该算法给出货箱装船问题、背包问题、拓扑排序问题、二分覆盖问题、最短路径问题、最小代价生成树等问题的求解方案。-Greedy algorithm, this chapter first introduces the concept of optimization, then introduces an intuitive problem-solving methods: greedy algorithms. F
Figure-topological-sort
- 拓扑排序 对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任 意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。 通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。 注意: ①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。 ②若图中存在有向环,则不可能使顶点满足拓扑次序。 ③一个DAG的拓扑序列通常表示某种方案切实可行。 -Top
tuopu
- 图形化的拓扑排序 可以单步演示结果 也可以直接显示结果-Topological sort of graphical presentation can be single-step results can display the results
tuopupaixu
- 数据结构实验,关于拓扑排序的,希望对大家有帮助-Experimental data structure, on the topological sort, we hope to help
MyTopSort
- 数据结构与算法设计Project中的拓扑排序,实现对文件中课程要求的读取,并实现对其拓扑排序成课表。-This is a project,it can read requirements from a file and make a topsort for it then get a schedual of students subjects.
Topological_order
- 这是一个基于图的拓扑排序的小程序,有深度优先和广度优先两种方法遍历-This is a graph-based topological sort of small programs, depth first and breadth-first traversal of two ways
gjlj
- 关键路径求解,使用C语言做的课程设计,通过链表和拓扑排序寻找关键路径,适合做课程设计使用。-Critical path, use the C language to the curriculum design, and topological sorting through the list to find the critical path, suitable for curriculum use.
Map22
- 一个基于VC的有向无环图操作实例源代码,图的节点可以使任意可插入OLE项,在编辑一栏,您可以插入节点、删除节点、拓扑排序、广度遍历、最短路径、插入边等操作,该程序作者是中国地质大学的姜景捷。 -A VC' s are based on directed acyclic graph operation source code examples, graph nodes can be inserted into OLE can make any entry in the Edit colu
topologytest
- 这是一个有关于拓扑排序的测试文件,讲图通过拓扑排序,输出排序后结果-the test of topological sorting
17
- 这里是一个相关的拓扑排序的小程序,用于排序课表的先修关系,采用C语言编写-Topological sort
topology-algorithms
- 拓扑排序是有向无环的一种重要的应用,实现了算法和数据结构的关系密切。-Topological sort is a directed acyclic important application, to achieve the algorithms and data structures are closely related.
Graph
- 数据结构,图部分,C++编写的,具有创建、遍历、拓扑排序等函数。控制台程序。-Data structures, graph part, C++ written with creation, traversal, topological sorting and other functions. Console application.
Class_Plan-1.3
- 实现了所选课程的正确排序,由于部分课程有先修课程,因此用到了拓扑排序的知识。-Selected the correct course to achieve the sort, as some courses have pre-course, so use a topological sort of knowledge.
tuopu
- 图的拓扑排序 输入存储有向图 查找第一个入度为零的顶点,有就返回OK 没有则输出ERROR 用主对角线元素做“标记”当所有主对角线元素都变为1时,完成拓扑排序-Topological sorting of the input memory graph directed graph to find the first zero-degree vertices, there is no OK to return to the output ERROR to do with the main diag
Sorting-algorithm
- 排序算法,包括拓扑排序、实数冒泡排序、复数冒泡排序等多种排序算法优化。-Sorting algorithm, including the topological sorting, real bubble sort, bubble sort, and other complex sorting algorithm optimization.