Re: [Dynagraph2-users] Further information on the C++ library

[Gordon W. <go...@wo...>]

Hi Martin,

Sorry for the slow response.

I think that Dynagraph may be able to do what you want, as long as you don't expect edges to cross between levels. I.e. as long as each cluster is completely self-contained and edges connect  to the outside of the cluster and not to any nodes inside it. Nodes within a cluster can of course be connected.

The way you would do this is model every cluster as its own layout graph. Then you would use the bounding box calculated to find the size of the node for the graph containing the cluster-node.

Dynagraph's arbitrary-sized nodes were designed for this purpose, in the context of Dynagraph for Windows, where each node can contain an arbitrary OLE object, including another graph layout.

Dynagraph does not, however, have any concept of clustering, so you'd have to shuttle the changing node sizes from one layout to another. The simplest thing to do would be to calculate the deepest clustered layouts first and then work outward from there.

Cheers
Gordon


On Jun 27, 2013, at 10:49 AM, "Martin Johnsson" <mjo...@ts...> wrote:

> Hi Gordon,
>  
> Thanks for response. Must admit I’m not exactly sure what you mean by “layout system” so apologies for my ignorance. But perhaps I can describe in more precise terms what I’m looking for:
>  
> -          Within the simulator I create nodes connected by links; the complete topology can generally be of any size. Each node is provided with coordinates.
> -          For reasons of scalability the simulator creates node clusters dynamically and where each cluster is represented by a supernode (but which is modelled as any other node) and those nodes are intern connected by links (and which are also modelled as any other link). This can go on recursively whereby a hierarchy of network topologies are created for each new level of cluster representations.
> -          Nodes and links may come and go at any time during the simulation, and nodes may also move in the topology, and which in turn may affect the node clustering and its representation through supernodes.
>  
> What I would like to do is that at each iteration cycle of the simulator I can present graphically an up-to-date view of the complete network topology, preferably also including the hierarchy as described above. I would thus hope that I can provide Dynagraph with information of the nodes and how they are connected via links, and where Dynagraph would fix and make the graphical presentation including reflecting any updates made to the topology. It looks like I need to figure out the changes myself, right, and provide Dynagraph with a kind of list of changes, correct? For very large topologies you could possibly only represent the network topology at the highest node clustering level but then allow for “freezing” so that each supernode becomes clickable to reveal the underlying node cluster it represents.
>  
> Indeed, I may ask for a whole lot ;-), but perhaps some of what I describe above is supported by Dynagraph.
>  
> Cheers,
>   /Martin
>  
> From: Gordon Woodhull [mailto:go...@wo...] 
> Sent: 27 June 2013 15:15
> To: Martin Johnsson
> Cc: dyn...@li...
> Subject: Re: [Dynagraph2-users] Further information on the C++ library
>  
> Hi Martin,
>  
> Unfortunately the C++ example got out of date when the configuration system got more sophisticated.  My guess is that once you get a layout system set up, actually manipulating a graph layout will be a cinch.  Or do I have the right question?  ;-)
>  
>  
> Cheers,
> Gordon
>  
>  
> On Jun 26, 2013, at 3:32 AM, "Martin Johnsson" <mjo...@ts...> wrote:
> 
> 
> Hi,
>  
> I wonder if there is more comprehensive and detailed information available from somewhere/someone on the use of the C++ library as I would like to call upon Dynagraph directly from within a network simulator that I have developed.
>  
> Kind regards,
>   /Martin
> ------------------------------------------------------------------------------
> This SF.net email is sponsored by Windows:
> 
> Build for Windows Store.
> 
> http://p.sf.net/sfu/windows-dev2dev_______________________________________________
> Dynagraph2-users mailing list
> Dyn...@li...
> https://lists.sourceforge.net/lists/listinfo/dynagraph2-users
>