[BGL] 2D/3D layout algorithms
Has anyone adapted any 2D and/or 3D graph layout algorithms to work with Boost ( i.e. minimum crossing etc...). Seems an obvious question, but I did not find anything via searching... Andrew
On Wed, 2002-09-04 at 18:09, Andrew Cunningham wrote:
Has anyone adapted any 2D and/or 3D graph layout algorithms to work with Boost ( i.e. minimum crossing etc...).
Seems an obvious question, but I did not find anything via searching...
I most likely will sometime in the future (not a high priority for me as of now), but haven't seen anything around which is directly implemeneted for BGL. Anyway, a websearch should give you the necessary algorithms (if you don't allready have them). Don't know how much work they are to implement, I'm pretty fresh in the BGL game myself. Let us know if you go ahead and do this and decide to share your work. I'm not sure if graph layout algos fit into the BGL, allthough I think they would (a lot of people are probably interested in visualizing their graphs). Maybe Jeremy could comment on that? Regards, Tarjei
From what I understand, there's quite a lot to graph layout. It would
probably warrant being its own library. For now, I just use graphviz. I used graphviz to do all the graph diagrams in the BGL book, and thus saved a ton of time! On 4 Sep 2002, Tarjei Knapstad wrote:
Let us know if you go ahead and do this and decide to share your work. I'm not sure if graph layout algos fit into the BGL, allthough I think they would (a lot of people are probably interested in visualizing their graphs). Maybe Jeremy could comment on that?
Regards, Tarjei
---------------------------------------------------------------------- Jeremy Siek http://www.osl.iu.edu/~jsiek/ Ph.D. Student, Indiana Univ. B'ton email: jsiek@osl.iu.edu C++ Booster (http://www.boost.org) office phone: (812) 855-3608 ----------------------------------------------------------------------
Has anyone adapted any 2D and/or 3D graph layout algorithms to work with Boost ( i.e. minimum crossing etc...).
Seems an obvious question, but I did not find anything via searching...
Andrew
There is an example in the BGL book where a GraphViz structure is read (a .dot file). See also; http://www.boost.org/libs/graph/doc/read-graphviz.html and http://www.research.att.com/sw/tools/graphviz/ Whether not you can produce .dot files from your software is another matter ;-) Good luck! Alex
On Thu, 2002-09-05 at 15:50, Alex Henderson wrote:
Has anyone adapted any 2D and/or 3D graph layout algorithms to work with Boost ( i.e. minimum crossing etc...).
Seems an obvious question, but I did not find anything via searching...
Andrew
I forgot yesterday, but there's a graph library called GOBLIN at http://www.math.uni-augsburg.de/opt/goblin.html which has a a few ways of doing 2D layout (code available at the site).
There is an example in the BGL book where a GraphViz structure is read (a .dot file). See also;
http://www.boost.org/libs/graph/doc/read-graphviz.html and http://www.research.att.com/sw/tools/graphviz/
Whether not you can produce .dot files from your software is another matter ;-)
And it's still GraphViz that does the layout work for you :) Code for the GraphViz library and tools is also available though: http://www.research.att.com/sw/tools/graphviz/ Cheers, Tarjei
participants (4)
-
Alex Henderson -
Andrew Cunningham -
Jeremy Siek -
Tarjei Knapstad