LCA's and graphs

[Robert Collins]

This paper: http://citeseer.ist.psu.edu/bender01finding.html is an
interesting read. In particular they use the same definition for least
common ancestor of two nodes as we desire for our merge basis: The
common ancestor with the longest path from the origin.

The preprocessing work that is talked about is potentially useful in
terms of indexes: A large blob with the entire repo in it could have a
preprocessed graph stored somewhere. We'd need to consider the
distributed nature of our system and combining such preprocessed things
at runtime.

Rob
-- 
GPG key available at: <http://www.robertcollins.net/keys.txt>.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: This is a digitally signed message part
Url : https://lists.ubuntu.com/archives/bazaar/attachments/20070612/e9297114/attachment.pgp