Topological sort is a graph algorithm. Briefly, to give a total order on the set of a partial order on a set, this operation is called topological sorting order of this operation is called the topology derived sequence.
That's sort of how we should do?
That's the focus of our current research.
This is the process of topological sorting operation, let's explain it.
1. Find a point of 0 degree of the
2. delete all of its edges, it will be placed in the queue
3. Locate the other is 0 points
4. delete all of its edges, it will be placed in the queue
5. Repeat 1 and 2, until all the points are placed in the queue
Therefore, the topology of FIG sequence is 02,143.
Therefore, the basic operation is the topological sort:
how about it? Pretty simple, right?
But I have to tell you that this is just the entry topological sorting it.
So continue its efforts to temper forward!
Original: https://blog.csdn.net/qq_44635637/article/details/89789242