[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Axiom-developer] touchgraph, hypertex, hypergraph

From: Pierre Doucy
Subject: Re: [Axiom-developer] touchgraph, hypertex, hypergraph
Date: Thu, 20 Jan 2005 11:03:42 +0100

Hi all,

I'm not sure I fully understand what you what to do w/ graphs and if
you really need the "click somewhere to move the graph", but here we

> There is another project called HyperGraph that is quite similar
> to TouchGraph but uses a hyperbolic layout. See
> [...] 

Graphviz ( ) might help too. I won't give you
a java applet, but just any graphic file format (PDF, PS, JPG, ...),
and is available both from a standalone command-line program, or
through a programmatic interface.

> But when I gave it the full 1300 node graph, what it drew was
> a graph so dense that all the edges overlapped into something
> that looked just like a big ball of wool and the program took
> a very long time to redraw the graph if you even touched it
> anywhere [...]

Depending on the complexity of your graph, graphviz is able to draw
huge graphs without too much pain, and the layout is generally very

> Clearly in order to draw the Axiom algebra graph, we are going
> to have to do it in some hierarchical manner but hopefuly one
> that can be computed from the structure of the graph - not
> imposed manually like the current layers in the Axiom makefiles.
> Some day real soon now I hope to find a source for some cookbook
> graph theory programs what can manipulate graphs of this size,
> find strongly connected component, prune redundant edges, etc.

There's a (C++) library - boost (,, which is
a generic programming library, allowing you to represent a graph in
any manner (adjacency lists, adjacency matrix,...) , and provides some
basic algorithms.
The paradigm behind boost - generic programming - is somewhat weird,
but it actually allows great flexibility. I used it in a project
related to random graphs/social networks. If I remember well, someone
I used to work with (and who reads this list) implemented the
algorithm to find strongly connected components.
Besides, it integrates with graphviz, in the sense that you can import
and export from the graphviz format to boost (see, )

Hope that helps...


Cats are intended to teach us that not everything in nature has a function.

reply via email to

[Prev in Thread] Current Thread [Next in Thread]