Files
gonum/graph
Dan Kortschak e42c1265cd graph/traverse: reduce edge visiting/traversal confusion
The Visit function was originally intended to allow the user to visit nodes
with an understanding of the path which edge was used to reach the node. This
was misguided because it implies the existence of an invariant that does not
exist; every edge into a node is passed to Visit as its node end points. This
does not happen because Visit is only called after the node being traverse to
is tested for having been visited, leading to surprising behaviour. So this
change makes Visit only consider the visited node.

The function that was originally intended to be provided by Visit is not given
by the Traverse function — previously EdgeFilter — which is called prior to
the node's visited status test. The node's visited status can be determined
via the walker's Visited method if needed. To avoid painting the edge visiting
method as purely a filter, it is renamed Traverse.
2019-03-26 07:41:45 +10:30
..
2017-05-23 00:02:59 -06:00
2019-03-13 09:01:10 +10:30
2017-07-10 07:03:44 +09:30

Gonum graph GoDoc

This is a generalized graph package for the Go language.