Topological ordering of a forward graph

Topological ordering of a forward graph

Topological ordering is another operation that can be simulated with diagrams, which can be used to represent a situation in which certain events must be arranged or occur in a particular order. , such as the priority relationship of the curriculum.

The idea of topological sorting algorithm is not general but the algorithm is simple

1: Find a vertex that has no successors.

2: Delete this vertex and insert the vertex marker in front of the list.

Repeat steps one and two until all vertices are deleted this time the list is displayed in the order that the topology is sorted.

To be continued ........ ...........

Topological ordering of a forward graph