Download

Graphlet

Binaries

• We provide Binaries for Windows (32 bit versions), Solaris and Linux.

See also the FAQ on source code and copyright.

Sample Code

The graphlet sample code shows how to implement a simple algorithm in C++ and Graphscript.

Download gt_sample.zip

Portable GML Parser

Marcus Raitner has implemented a portable GML parser which can be used independently of Graphlet and LEDA. This software package is written in C.

Download gml_parser.tar.gz [11k] or gml_parser.zip [13k]

Documentation

• Coding Standards
• C++ Interface Manual
• Graphscript Manual
• GML File Format Manual

Postscript code for older manuals (LaTeX based) :

• Graphscript Manual
  Graphscript.ps.gz [160k],Graphscript.ps.zip [160k]
• C++ Interface Manual
  Cpp.ps.gz [144k], Cpp.ps.zip [144k]
• GML File Format Manual
  GML.ps.gz [120k], GML.ps.zip [120k]

LSD Library

Several of Graphlet's graph drawing algorithms have been ported from Graphlet's predecessor GraphEd. The LSD library (implemented by Dirk Heider) is also available as a separate file:

LSD.tar.gz [362k], LSD.zip [486k]

The following algorithm are included in this file:

• Connectivity Tests
• Planarity Test (Hopcroft & Tarjan)
• Spring Embedder (Fruchtermann & Reingold)
• Spring Embedder (Kamada & Kawai)
• GEM Spring Embedder (code used by permission of A. Frick)
• Tunkelang's Algorithm
• Directed acyclic graph drawing (Eades & Sugiyama)
• Tree Drawing (Reingold & Tilford)
• Tree Drawing (Walker)
• Convex Drawing of planar graphs (Chiba et al.)
• Bend mininal, orthogonal drawing of planar graphs (Tamsssia, extensions by U. Fößmeier).

Please not that the LSD library is distributed as is. This project is no longer maintained.

Back to the Graphlet Website
Last modified Thursday, January 21, 1999 9:52 AM