| commit | 87d0848d38fe3a95598717ac58b7633518a86b59 | |
| author | David Aguilar <davvid@gmail.com> | |
| Thu, 17 Jun 2010 21:05:21 +0000 (17 14:05 -0700) | ||
| committer | David Aguilar <davvid@gmail.com> | |
| Thu, 17 Jun 2010 21:05:21 +0000 (17 14:05 -0700) | ||
| tree | a012234cc2079bc26c75478dd4d55e0431724aff | treesnapshot (tar.gz zip) |
| parent | 203d59b115bd7dd653b68892fb6fd514df628480 | commitdiff |
views.dag: Improve the graph layout algorithm
This algorithm is slightly more appealing because it bends chains
of commits that lead to parallel branches.
It's not perfect, but it's one of the simpler things we can do
with the streaming one-node-at-a-time approach in use.
We could probably make a very nice layout by post-processing
the graph using a thread but it's not *that* bad, either.
Signed-off-by: David Aguilar <davvid@gmail.com>
This algorithm is slightly more appealing because it bends chains
of commits that lead to parallel branches.
It's not perfect, but it's one of the simpler things we can do
with the streaming one-node-at-a-time approach in use.
We could probably make a very nice layout by post-processing
the graph using a thread but it's not *that* bad, either.
Signed-off-by: David Aguilar <davvid@gmail.com>
| cola/views/dag.py | diffblobblamehistory |