This Wikipedia explanation: Data Flow Analysis
This is a typical iteration order for problems with direct data flow. In a reverse post-iteration iteration, a node is visited before any of its successor nodes has been visited, unless the successor reaches the trailing edge. (Please note that this is not the same as pre-order.)
Can someone explain this in more detail?
Reordering, as the name suggests, gives the exact opposite of post-order traversal.
Example
For the above directional graph
workarounds: DBCA and DCBA
: A C B D A B C D
- postorder.
, .
.
