Re: [graphviz-interest] Performance - number of ranks
"Emden R. Gansner" <[email protected]> Thu, 28 Aug 2014 12:54:35 -0400
| Newsgroups | gmane.comp.video.graphviz |
|---|---|
| Message-ID | <[email protected]> |
On 8/28/14, 5:52 AM, paul womack wrote:
> Is this the expected performance relationship?
Try running dot -v to see where the time is spent. Without further data,
I'm guessing the problem is in crossing
minimization. If you have a lot of ranks, and a lot of reasonably
disjoint paths going from the top to the bottom
(which I'm guessing you would in a genealogy graph), there are going to
be a lot of dummy vertices introduced
every place an edge crosses a rank. This can cause the number of nodes
to explode, to the detriment of the time
it takes to try to unwind the edges.
Emden
_______________________________________________
[email protected]
http://lists.research.att.com/mailman/listinfo/graphviz-interest