[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Monotone-commits-diffs] Revision 50c908c9100532fa53ef2f70fd09deb3fa2001
From: |
monotone |
Subject: |
[Monotone-commits-diffs] Revision 50c908c9100532fa53ef2f70fd09deb3fa2001de |
Date: |
Tue, 6 Nov 2007 20:07:24 +0100 |
-----------------------------------------------------------------
Revision: 50c908c9100532fa53ef2f70fd09deb3fa2001de
Ancestor: 5f100afae5153e6820c80c927bfdfafe944441d9
Author: address@hidden
Date: 2007-08-09T06:36:32
Branch: net.venge.monotone.cvsimport-branch-reconstruction
Modified files:
rcs_import.cc
ChangeLog:
* We run Dijkstra's algorithm to find the shortest path from a back
edge's target to the source. Thus finding the smallest cycle including
that edge. This replaces the former method, which was solely based on
the coloring of the depth first search algorithm.
txtqiy_lDjfdw.txt
Description: Diff [5f100afae5153e6820c80c927bfdfafe944441d9] -> [50c908c9100532fa53ef2f70fd09deb3fa2001de]
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [Monotone-commits-diffs] Revision 50c908c9100532fa53ef2f70fd09deb3fa2001de,
monotone <=