Back
pre-edge-traverse (clj)
(source)function
(pre-edge-traverse successors start & {:keys [seen], :or {seen #{}}})
Traverses a graph depth-first preorder from start, successors being
a function that returns direct successors for the node. Returns a
lazy seq of edges, each edge being a vector [source-node dest-node].
Note that for undirected graphs each edge will be returned twice,
once for each direction.