Description: A topological sort
The basic steps of the algorithm are as follows:
1. Select a vertex of 0 from the diagram and output the vertex;
2. Remove the vertex and its associated arc from the diagram, and adjust the entry of the arc head of the deleted arc (entry - 1);
Repeat execution, until all the vertices are output, the topological sort is completed or the graph has no more than 0 at the vertex (which indicates that the original graph contains the loop).
To Search:
- [greedy_tuopupaixu] - of greed in topological sorting algorith
- [xiaoliang1tuopu] - not topological sorting input vertices e
- [data] - Abstract: This procedure will create a s
- [tu] - Keyboard input data, the establishment o
- [graph] - Realize undirected graph (or digraph) ex
- [DiGraphs] - Directed graph of a painting process. Wh
- [GraphFunc] - Data structure relating to graph algorit
- [OpenFolder] - Open a folder realize method is quite us
- [drv5045] - C51-based single-chip spi-bus driver cod
- [QR_algrithm] - Matrix eigenvalues and eigenvectors of t
File list (Check if you may need any files):
Download