Exhaustive graph traversal
Revision as of 12:18, 10 October 2014 by Weihe (talk | contribs) (Created page with "== Input == A directed graph <math>G=(V,A)</math>. == Output == A sequence of all nodes of <math>G</math>. == Known algorithms == # Repeated...")
Input
A directed graph [math]\displaystyle{ G=(V,A) }[/math].
Output
A sequence of all nodes of [math]\displaystyle{ G }[/math].