Graphviz vs boost.Graph: which is recommended?
Hello, I am about to start a subproject that takes a graph, computes a layout and draws it on screen (Windows XP). I thought about using AT&T's well known graphviz library until I saw that on boost 1.32 there's a new algorithm: "boost::kamada_kawai_spring_layout". Although I am tempted to use boost's lib, tradition dictates that a longer/better tested and implemented library is the way to go. Do you happen to have any experience in this kind of problem (drawing graphs)? Any suggestions/ caveats ? Thanks... --- Outgoing mail is certified Virus Free. Checked by AVG anti-virus system (http://www.grisoft.com). Version: 6.0.799 / Virus Database: 543 - Release Date: 19-Nov-04
On Nov 23, 2004, at 4:14 PM, Dan Dimerman wrote:
I am about to start a subproject that takes a graph, computes a layout and draws it on screen (Windows XP). I thought about using AT&T's well known graphviz library until I saw that on boost 1.32 there's a new algorithm: "boost::kamada_kawai_spring_layout". Although I am tempted to use boost's lib, tradition dictates that a longer/better tested and implemented library is the way to go.
Do you happen to have any experience in this kind of problem (drawing graphs)? Any suggestions/ caveats ?
GraphViz will generally do a much better job of laying out a graph for you. It contains several algorithms for both directed and undirected graphs, and handles tricky issues such as edge routing and label placement that the BGL does not do now. In the future, BGL's layout routines will probably improve (for instance, there's an additional layout algorithm in CVS now). Doug
What's the new layout algorithm based on? On Nov 23, 2004, at 9:01 PM, Doug Gregor wrote:
On Nov 23, 2004, at 4:14 PM, Dan Dimerman wrote:
I am about to start a subproject that takes a graph, computes a layout and draws it on screen (Windows XP). I thought about using AT&T's well known graphviz library until I saw that on boost 1.32 there's a new algorithm: "boost::kamada_kawai_spring_layout". Although I am tempted to use boost's lib, tradition dictates that a longer/better tested and implemented library is the way to go.
Do you happen to have any experience in this kind of problem (drawing graphs)? Any suggestions/ caveats ?
GraphViz will generally do a much better job of laying out a graph for you. It contains several algorithms for both directed and undirected graphs, and handles tricky issues such as edge routing and label placement that the BGL does not do now. In the future, BGL's layout routines will probably improve (for instance, there's an additional layout algorithm in CVS now).
Doug
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users
On Nov 24, 2004, at 10:19 AM, Thomas Costa wrote:
What's the new layout algorithm based on?
It's the Fruchterman-Reingold force-directed layout algorithm. All pairs of vertices have a repulsive force pushing them apart, and all adjacent vertices have an attractive force pulling them together. It's in CVS, if you're really curious about it. Doug
Just curious if you got tired of waiting for me to write a version of clan decomposition based layout and wrote it yourself. On Nov 24, 2004, at 7:59 AM, Doug Gregor wrote:
On Nov 24, 2004, at 10:19 AM, Thomas Costa wrote:
What's the new layout algorithm based on?
It's the Fruchterman-Reingold force-directed layout algorithm. All pairs of vertices have a repulsive force pushing them apart, and all adjacent vertices have an attractive force pulling them together. It's in CVS, if you're really curious about it.
Doug
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users
On Nov 24, 2004, at 12:03 PM, Thomas Costa wrote:
Just curious if you got tired of waiting for me to write a version of clan decomposition based layout and wrote it yourself.
No, no; just working through a few of the "classic" layout algorithms as a start. We would absolutely love to see new and different layout algorithms in the BGL. Doug
FWIW - I use the BGL to store my graph data and calculate shortest paths etc., I use raw GDI (fast) and AGG (smooth - www.antigrain.com) to render the data. For layouts I have a few of my own (simplistic) I also use GraphViz (as there is a save to and load from DOT functions within BGL). Gordon. "Dan Dimerman" <dimerman@netvision.net.il> wrote in message news:co097h$nch$1@sea.gmane.org...
Hello,
I am about to start a subproject that takes a graph, computes a layout and draws it on screen (Windows XP). I thought about using AT&T's well known graphviz library until I saw that on boost 1.32 there's a new algorithm: "boost::kamada_kawai_spring_layout". Although I am tempted to use boost's lib, tradition dictates that a longer/better tested and implemented library is the way to go.
Do you happen to have any experience in this kind of problem (drawing graphs)? Any suggestions/ caveats ?
Thanks...
--- Outgoing mail is certified Virus Free. Checked by AVG anti-virus system (http://www.grisoft.com). Version: 6.0.799 / Virus Database: 543 - Release Date: 19-Nov-04
participants (4)
-
Dan Dimerman -
Doug Gregor -
Gordon Smith -
Thomas Costa