Exhaustive graph traversal

From Algowiki
Revision as of 07:21, 3 November 2014 by Weihe (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Input

A directed graph [math]\displaystyle{ G=(V,A) }[/math].

Output

A sequence of all nodes of [math]\displaystyle{ G }[/math].

Known algorithms

  1. Repeated depth-first search
Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Exhaustive_graph_traversal&oldid=1751"