Exhaustive graph traversal

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