'Tests that a node is always reachable from itself.'

def test_same_node_is_reachable(self):

    G = DiGraph((sorted(p) for p in combinations(range(10), 2)))
    assert_true(all((is_reachable(G, v, v) for v in G)))
