Exhaustive graph traversal: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 8: | Line 8: | ||
== Known algorithms == | == Known algorithms == | ||
[[Repeated depth-first search]] | # [[Repeated depth-first search]] | ||
Latest revision as of 07:21, 3 November 2014
Input
A directed graph [math]\displaystyle{ G=(V,A) }[/math].
Output
A sequence of all nodes of [math]\displaystyle{ G }[/math].