| compound graph representation in zest [message #240220] |
Fri, 07 December 2007 20:20  |
Eclipse User |
|
|
|
Originally posted by: hamoun.gh.gmail.com
Hello All
I am wondering if there is a way to tell Zest to computationally exclude
some edges while calculating nodes' positions. My final goal is to represent
a compound directed graph (digraph) comprised of a tree and an additional
(directed) adjacency graph. and I want the algorithm to position nodes only
based on the tree and not adjacency graph. For example representing the
tree structure using radial layout and then calculating the best way to
connect nodes using adjacency(non-hierarchical) edges. One way is discussed
in "Hierarchical Edge Bundles: Visualization of Adjacency Relations in
Hierarchical Data". It uses the curvature along with compound graphs to
represent a clean view. but no tool support is available there.
Thanks,
Hamoun
|
|
|
| [Zest] Re: compound graph representation in zest [message #240282 is a reply to message #240220] |
Thu, 13 December 2007 22:23  |
| Eclipse User |
|
|
|
Originally posted by: irbull.cs.uvic.ca
Great Question!!!
The layouts do support filtering of edges and nodes, although I have
never actually used them. I tried to put a snippet together to ensure
they work and I realized that I don't expose a few methods that you will
need. I am putting a fix into Zest right now for this.
Thanks again for bringing this up. I will also post a snippet to
demonstrate it when I get it working.
cheers,
ian
Hamoun wrote:
> Hello All
>
> I am wondering if there is a way to tell Zest to computationally exclude
> some edges while calculating nodes' positions. My final goal is to represent
> a compound directed graph (digraph) comprised of a tree and an additional
> (directed) adjacency graph. and I want the algorithm to position nodes only
> based on the tree and not adjacency graph. For example representing the
> tree structure using radial layout and then calculating the best way to
> connect nodes using adjacency(non-hierarchical) edges. One way is discussed
> in "Hierarchical Edge Bundles: Visualization of Adjacency Relations in
> Hierarchical Data". It uses the curvature along with compound graphs to
> represent a clean view. but no tool support is available there.
>
> Thanks,
> Hamoun
>
>
|
|
|
Powered by
FUDForum. Page generated in 0.01964 seconds
] 
Search
Help
Register
Login
Home
