- Category:
- Data structs
- Tags:
-
- File Size:
- 2kb
- Update:
- 2018-04-10
- Downloads:
- 0 Times
- Uploaded by:
- 晴栀菀歌°
Description: Topological sort
A topological sort for a Directed Acyclic Graph (DAG) G is a linear sequence of all vertices in G, which makes any pair of vertices u and V in the graph, and if the edge (U, V) E (G) appears in the linear sequence, it appears before the linear sequence. Usually, such a linear sequence is called a sequence satisfying topological order (Topological Order), or topological sequence. Simply speaking, a complete order on the set is obtained from a partial order on a set. This operation is called topological sorting.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 有向图邻接表的建立，深度广度搜索及拓扑排序.cpp | 4688 | 2018-04-10 |
Download