kostko / foograph Goto Github PK

Performance tests show that JS Arrays are faster than linked lists when
adding new elements and considering 10000000 entries (11.698 s for linked
list vs. 8.735 for array).

Define json input format.

The attached patch removes dependencies on global variables g, width, and 
height and replaces 
them with uses of instance properties and local variables.

There should be a global list of imported graphs. Graphs can be imported by  
a functions, which adds a new graph to a list and updates the GUI (adds a 
new entry to a dropdown box)

Each test graph should reside in it's own file and call register function.

In line 107 you have

e = g.insertEdge("", 3, componentCenters[i], componentCenters[j]);

but g is not defined. It works in your demo because the graph is instantiated 
in g. To fix the bug, it should be:

e = graph.insertEdge("", 3, componentCenters[i], componentCenters[j]);

There should be an option for drawing "small" nodes; i.e. without labels 
and only a few pixels wide. This is a must for viewing larger graphs.

Weights could/should effect the forces between two nodes. Some 
experimentation might be in order :).

http://www.csse.monash.edu.au/hons/se-
projects/2006/Kieran.Simpson/output/html/node10.html

http://www.boost.org/doc/libs/1_38_0/libs/graph/doc/kamada_kawai_spring_lay
out.html

If a tree contains multiple root candidates, they are all drawn on level 0.

An algorithm to find more appropriate positions is needed.

Each layout function should be in it's own file

Vertex positioning should be separated from edge positioning.

Function creating vertex layout must make sure that there is enough space 
for vertex representation.

When vertex coordinates are known, edges can be added. An edge may never 
touch a vertex, except the ones defining it.

Support for directed edges and loops.

read through an try to implement:

http://www.wisdom.weizmann.ac.il/~dharel/papers/DG_final.pdf