This language bar is your friend. Select your favorite languages!

Idiom #130 Depth-first traversing in a graph

Call a function f on every vertex accessible for vertex v, in depth-first prefix order

Illustration
#Edit dateEdit SummaryEditor
👁 Δ 8 2019-01-05, 11:46 New Rust implementation by user [freecoder] freecoder
👁 Δ 7 2018-04-08, 19:18 [Python] line width bukzor
👁 Δ 6 2018-04-08, 19:17 New Python implementation by user [bukzor] bukzor
👁 Δ 5 2016-09-20, 22:19 Updated picture URL by user [] programming-idioms.org
👁 Δ 4 2016-05-02, 12:50 Linked to idiom #18 [Depth-first traversing of a tree] programming-idioms.org
👁 Δ 3 2016-05-02, 12:50 Linked to idiom #40 [Graph with adjacency lists] programming-idioms.org
👁 Δ 2 2016-05-02, 12:49 Linked to idiom #129 [Breadth-first traversing in a graph] programming-idioms.org
1 2016-05-02, 12:49 Idiom creation by user [programming-idioms.org] programming-idioms.org