Method visit

test/test_graph.py:412–413

(node)

    def test_search(self):
        # Assert depth-first vs. breadth-first search.
        def visit(node):
            a.append(node)
        def traversable(node, edge):
            if edge.node2.id == "e": return False
        g = self.g