Force directed Graph Layout

This small page arised from a project in bioinformatics lecture from Professor V. Helms at the University of the Saarland.

In bioinformatics there are huge masses of data to handle. On example are networks like protein interaction networks or metabolic networks, represented as a graph. The idea is to find a layout of such a graph, that is best human readable.

Therefore we apply an algorithm that simulates the graph with the edges being springs that force the nodes into required distanced and all nodes, causing an repulsive force on all other nodes.

You can download the source code of the python program here if you are interested in the work. Make sure to have Python and the TK-interface module installed - otherwise it will not work.
The source is free - do with it what ever you like to. Don't hesitate to send me your comments:

Force directed Graph Layout, version 0.1 - Source code
Force directed Graph Layout, version 0.1 - Executable (Windows)

How to operate the program

Some screenshots