1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
|
===============================================================================
2012-12-05_15-19
http://sixdegrees.hu/last.fm/technical_details.html
http://sixdegrees.hu/last.fm/interactive_map.html
===============================================================================
http://www.last.fm/inbox/compose?to=ntamas
Hello,
I just found your last.fm map while searching about igraph, and wow, nice :) I really love the life that comes out of it.
Then i red the tech details page, and there you are talking about the DrL graph layout algorithm of igraph, and from what i understand it could be used to handle "dynamic" graphs, meaning you can add verticles / edges to an already existing graph. I quickly red http://igraph.sourceforge.net/doc/html/ch18s01.html#idp25263952, and this seems possible but non obvious for me :p
I'm currently writing a real time computer network visualisation tool in C, displaying nodes (machines) and links between them (network traffic).
Atm i'm thinking about using igraph to compute the coordinates of my nodes and links, before displaying them with an external graphical library.
In the network, new nodes come and go, as well as links, and in order to have a coherent display I need to have nodes that do not move too much when a node is added / removed.
Interpolation of old / new coordinates for nodes and links would be handled by the external graphical library.
So i'm interested in interested in adding new edges and verticles to a graph that has an already computed layout, and generate a new layout that includes my new verticles/edges without totaly breaking the previous layout.
Did you already do such stuff ? Do you know source code that does this with igraph so I can learn ? I'm really just discovering igraph and more or less the graphs in general.
If you have any pointers / advice for me it would be great !
Thanks,
Laurent
===============================================================================
|
