Re: Better repeated merge tracking...

%% Nathanael Nerode <neroden@twcny.rr.com> writes:

  nn> Of course, a good ancestor search algorithm might not be trivial,

Actually it's just a very simple shortest-path algorithm--you can find
excellent implementations in any first year computer algorithms course
book. I actually implemented one myself, in Perl, from the output of
ClearCase's version tree listing command (mine was based on a previous
implementation by Brad Appleton).

-- 
-------------------------------------------------------------------------------
 Paul D. Smith <psmith@nortelnetworks.com>   HASMAT--HA Software Mthds & Tools
 "Please remain calm...I may be mad, but I am a professional." --Mad Scientist
-------------------------------------------------------------------------------
   These are my opinions---Nortel Networks takes no responsibility for them.
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@subversion.tigris.org
For additional commands, e-mail: dev-help@subversion.tigris.org