diff options
Diffstat (limited to 'math/py-grandalf/pkg-descr')
| -rw-r--r-- | math/py-grandalf/pkg-descr | 22 |
1 files changed, 7 insertions, 15 deletions
diff --git a/math/py-grandalf/pkg-descr b/math/py-grandalf/pkg-descr index 673159be8430..c6cc12335ca3 100644 --- a/math/py-grandalf/pkg-descr +++ b/math/py-grandalf/pkg-descr @@ -1,15 +1,7 @@ -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 +Grandalf is a python package made for experimentations with graphs drawing +algorithms. It is written in pure python, and currently 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++), it provides a way to walk and draw 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. |