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...") |
No edit summary |
| (One intermediate revision by the same user not shown) | |
(No difference)
| |
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].