Linus Torvalds writes: > Right. This is why I would suggest just recomputing the thing entirely, > instead of trying to make it incremental. It would definitely cause > re-organization of the tree when you find a new relationship between two > old commits that basically creates a new orderign between them. I think it may be possible to back up the layout algorithm to the row where the parent is and redo it from there down. Interestingly, I only see two commits out of order on the linux-2.6 repository, but on the full history (up to linux-2.6.12-rc2) I see 520. > The menu would help, of course. But it would be even nicer if you'd be > able to make do without the --topo-order. The graph does seem to look a little nicer with --topo-order, in that it tends to do a whole string of commits on a single branch in a bunch, whereas without --topo-order it seems to hop from branch to branch more. Paul. - To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html