Graph layout algorithms

[GoogleCodeExporter]

It still would be nice to have some graph layout algorithms in this library.

Original issue reported on code.google.com by techtonik@gmail.com on 17 Apr 2011 at 12:02

[GoogleCodeExporter]

So this is a feature request? If it is can you please elaborate? 

You are also welcome to contribute any of your own code. Just post a patch 
(with unit tests and some rationale text) and I would be happy to include and 
maybe expand it in the existing code base.  

Cheers, Tomaž

Original comment by tomaz.ko...@gmail.com on 20 Apr 2011 at 5:50

• Added labels: Type-Enhancement, Priority-Low
• Removed labels: Type-Defect, Priority-Medium

[GoogleCodeExporter]

I don't own any graph layout code. You guys are experts at algorithms and 
possess all the books required. I am a simple user.

Original comment by techtonik@gmail.com on 20 Apr 2011 at 10:07

[GoogleCodeExporter]

Actually Wikipedia has a whole dedicated category 
http://en.wikipedia.org/wiki/Category:Graph_drawing but I am unlikely to 
revisit it any time soon.

Original comment by techtonik@gmail.com on 20 Apr 2011 at 10:10

[GoogleCodeExporter]

Generally we try to be driven by user's specific requirements. A single 
algorithm can often take many hours of developer time to perfect, so it would 
be nice to have a clear idea of exactly what you are intending to do, since as 
you point out, there are many ways to draw a graph.

If you have a need for a specific algorithm may I suggest you implement your 
own version and submit it to the team. We can help integrate it with the 
existing project. Contributions of code are warmly welcomed. 

Sal

Original comment by s...@stodge.org on 20 Apr 2011 at 10:32

[GoogleCodeExporter]

Right now I need to generate DAGs for changesets on App Engine using PyPNG 
http://mercurial.selenic.com/wiki/UnderstandingMercurial#Cloning.2C_making_chang
es.2C_merging.2C_pulling_and_updating

Original comment by techtonik@gmail.com on 20 Apr 2011 at 10:44