fix for a keyerror in finding least common ancestors

[Aaron Bentley]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Michael Hudson wrote:
> This 3-line but 600-odd kilobyte file:
> 
>     http://python.net/crew/mwh/g.txt
> 
> contains:
> 
>  - on line 1, a sanitized-revid repr() of the _graph_ancestors of the
> graph with ghosts of the repository that I can reproduce the problem with
>  - on lines 2 and 2 the revids that should be used as arguments to
> find_unique_lca.

Thank you very much.

> I tried to make a test case like this:
> 
>     def test_graph_lca_huge(self):
>         import os
>         f = open(os.path.join(os.path.dirname(__file__), 'g.txt'))
>         graph_repr = f.readline()
>         revid1 = f.readline()
>         revid2 = f.readline()
>         graph = self.make_graph(eval(graph_repr))
>         graph.find_unique_lca(revid1, revid2)
> 
> but this has been running for ~3 hours now, so another approach is
> probably required :-)

It's actually pretty easy to build a Graph on top of a dict, so I'll
just do that.

Aaron
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.6 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iD8DBQFGrzzu0F+nu1YWqI0RAjEtAJwNWcr9gbLCZca+TMwzhqx2MnbrUwCfYIFN
nj50e8SCluxy/sSipKEskX8=
=6lvK
-----END PGP SIGNATURE-----