Data structure--diagram (bottom)--topological sorting

Topological sorting

Mind mapping is also a kind of graph

Topological order : if there is a forward path from V to W in the diagram, V must precede w.  The vertex sort that satisfies this condition becomes a topological order. V-"W

The process of obtaining a topological order is the topological ordering

AoV If there is a reasonable topological order, it must be a directed acyclic graph (Directed acyclic graph, or dag).

The first row does not have a pre-course class. Then erase the vertices and edges, each output which vertex, without the predecessor vertex, the output (the degree of 0 vertex).

The final topological sequence produces a

Dag has a directed acyclic graph.

Application of topological sequencing AOE (Activity on edge) network each side represents a process, a very large project,

　　

Each side represents one thing, each of which is formed in the order of interdependence, and how much time is spent on each process.

There is a virtual edge, this imaginary edge of the time is 0,aoe network,

How long is the whole duration?

Which groups have maneuver time? Those groups are a day can not be delayed, delayed time will be postponed, which group time is delayed, delayed time will not be postponed. The time is not to be dead or to have maneuver time.

What is the critical path, those groups can not delay the day, once delayed, will be postponed, is the key path

Data structure--diagram (bottom)--topological sorting