~charles/graph

67fb25239556087c8a1aa80580d15cea984a9718 — Philip Conrad 2 months ago 1b91be7 master
fix typo in DFS iterator description

Signed-off-by: Philip Conrad <conradp@chariot-chaser.net>
1 files changed, 1 insertions(+), 1 deletions(-)

M node.go
M node.go => node.go +1 -1
@@ 465,7 465,7 @@ func (n Node) MustBFS() []Node {
	return result
}

// ForEachDFS implements a breadth-first traversal of the graph, rooted at node n.
// ForEachDFS implements a depth-first traversal of the graph, rooted at node n.
// Each time a node is visited, the callback is run on it. The callback may
// return "true" to indicate the search should continue, and "false" to
// indicate that the search should terminate.