History of Idiom 130 > diff from v1 to v2
Edit summary for version 2 by programming-idioms.org:
Linked to idiom #129 [Breadth-first traversing in a graph]
Linked to idiom #129 [Breadth-first traversing in a graph]
↷
Version 1
2016-05-02, 12:49:30
Version 2
2016-05-02, 12:49:53
Idiom #130 Depth-first traversing in a graph
Call a function f on every vertex accessible for vertex v, in depth-first prefix order
Idiom #130 Depth-first traversing in a graph
Call a function f on every vertex accessible for vertex v, in depth-first prefix order