Graph and drawing algorithms framework
Grandalf is a python package made for experimentations with graphs and drawing algorithms. It is written in pure python, and implements two layouts: the Sugiyama hierarchical layout and the force-driven or energy minimization approach. While not as fast or featured as graphviz or other libraries like OGDF (C++), GDToolkit (C), tulip (Java), it provides a way to draw and navigate graphs no larger than thousands of nodes, while keeping the source code simple enough to make it possible to easily tweak and hack any part of it for experimental purpose. With a total of about 1500 lines of python, the code involved in drawing the Sugiyama (dot) layout fits in less than 600 lines. The energy minimization approach is comprised of only 250 lines!
Grandalf does only two not-so-simple things:
- computing the nodes (x,y) coordinates (based on provided nodes dimensions, and a chosen layout)
- routing the edges with lines or nurbs
It doesn’t depend on any GTK/Qt/whatever graphics toolkit. This means that it will help you find where to draw things like nodes and edges, but it’s up to you to actually draw things with your favorite graphics toolkit.
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|File Name & Checksum SHA256 Checksum Help||Version||File Type||Upload Date|
|grandalf-0.55555-py2.7.egg (65.9 kB) Copy SHA256 Checksum SHA256||2.7||Egg||Jan 22, 2017|
|grandalf-0.55555-py2.py3-none-any.whl (31.3 kB) Copy SHA256 Checksum SHA256||py2.py3||Wheel||Jan 22, 2017|
|grandalf-0.55555-py3.5.egg (69.0 kB) Copy SHA256 Checksum SHA256||3.5||Egg||Jan 22, 2017|