Summary
keywords
TODO
HW
Exercise*
Next time
siblings are visited before children Time complexity $O(V+E)$
children are visited before siblings
pre-order : add the node to output when first visited(=when pushing into the stack)
post-order : add the node to output when there's no unexplored subnodes.
input should be directed graph with no cycle.
Excecute task which dependencies has been completed.
Last updated 11 months ago