Exhaustive graph traversal: Difference between revisions
Jump to navigation
Jump to search
(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...") |
|||
| Line 8: | Line 8: | ||
== Known algorithms == | == Known algorithms == | ||
[[Repeated depth-first search]] | |||
Revision as of 12:18, 10 October 2014
Input
A directed graph [math]\displaystyle{ G=(V,A) }[/math].
Output
A sequence of all nodes of [math]\displaystyle{ G }[/math].