History of Idiom 130 > diff from v2 to v3
Edit summary for version 3 by programming-idioms.org:
Linked to idiom #40 [Graph with adjacency lists]
Linked to idiom #40 [Graph with adjacency lists]
↷
Version 2
2016-05-02, 12:49:53
Version 3
2016-05-02, 12:50:07
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