搜索资源列表
TopSort
- 图的拓扑排序。采用邻接表存储结构。其中包含有栈的操作。-Map topological sort. The use of the adjacent table storage structure. Which contains a stack operation.
Topsort
- 所谓拓扑排序是指将顶点按照拓扑次序排列。有几种简单的算法可以求出一个图的拓扑次序。一种算法的思想如下： （1）在有向图中查找一个没有后继（或前驱）的顶点并添加到顶点表中。 （2）从图中删除该顶点和所有以该顶点为头（尾）的弧。 -The so-called topological sorting refers to the vertex order in accordance with the topology.
GraphAlgorithm
- 图论通用各种算法，有大量实例，包括BFS,DFS,Prim, kruskal,Dijkstra,Floyed,Aoe,Aov,topsort-General algorithms of graph theory, a large number of cases, including the BFS, DFS, Prim, kruskal, Dijkstra, Floyed, Aoe, Aov, topsort
TopSort
- java语言实现图的拓扑排序，图利用vector来存储-java language map of topological sorting, graph used to store vector
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.
question-6
- c++ 数据结构 实现图的拓扑算法和关键路径-Data struture of topsort in c++
topsort
- 拓扑排序的C++源码，一种有向无环图排序的重要的图论算法-Topological sort of C++ source code, a directed acyclic graph sort of important graph algorithms
topSort
- 拓扑排序的两种实现 拓扑排序的两种实现- Topological sorting Topological sorting Topological sorting
Topsort.cpp
- Topsort algorithm on directed acyclic graph.
TopSort
- c++拓扑排序。对一个有向无环图G进行拓扑排序 -C++ topological sort, using vc2008 MFC fr a mework implementations. In a Directed Acyclic Graph (Directed Acyclic Graph DAG) G for topological sort
topsort
- Topological Sorting. Creates all topological sorting of a given graph in Java. Lexicographical order varies.
Graph
- VC++编写的数据结构图算法演示系统，可作毕业设计系统，包含深、广度遍历，最小生成树，拓扑排序，最短路径算法。-Graph algorithm operating system,include depth/breath first search,minitree,topsort,shortestpath.
C
- C实现的一些数据结构,包括队列，散列表，栈，二叉树，图的拓扑排序-some data structure in C，including queue,hashtable,stack,tree,graph topsort
topsort
- Helper function: return distance(first, last) for forward iterators, or 0 for input iterators. -Helper function: return distance(first, last) for forward iterators, or 0 for input iterators.
topsort
- java 拓扑图排序 包含一些注释 易于理解-java topology contains some sort comments easy to understand
TopSort
- Programming Technique课程assignment 1，输入一组关系组，然后查找到所有相容的偏序。-Programming Technique course assignment 1, enter a relationship group, and then find all compatible partial order.