'Test that it works on non-empty graphs with no LCAs.'

def test_all_pairs_lowest_common_ancestor9(self):

    G = nx.DiGraph()
    G.add_node(3)
    ans = list(all_pairs_lca(G))
    assert_equal(ans, [((3, 3), 3)])
