Excellent readability of calculated layouts:

• Nodes are placed in a hierarchy of layers
• Nodes are positioned without overlapping
• Crossing of lines (edges) is reduced/avoided
• Edges are kept short and straight

  Fast layout calculation for huge graphs

  15 basic layout algorithms, including

• Force-directed layout
• Depth-first-search layout
• Specialized algorithm for layout of trees

  Zooming of graphs and easy navigation

  Easy printing of graphs on multiple pages

  Export of graphs to BMP, colored PostScript, SVG, PNG and HTML

  Graph nesting and advanced graph hierarchy operations like

• Folding, unfolding, wrapping and clustering of complete subgraphs
• Folding of user-defined graph regions
• Excluding subgraphs or graph regions
• Hiding of edges

  Cartesian and polar fish-eye views

  Animation of series of graphs and smooth transitions

  Multi-line edge labels

  Easy handling of huge graphs with as many as 1,000,000 nodes and 1,500,000 edges

  Commands, hyperlinks, JavaScript functionality, and up to three additional information windows can be associated with each node and each subgraph

  Nodes can be represented by user-defined bitmap icons

  The input format GDL (graph description language) provides for very natural textual graph representation, and is also easy to learn. Example:

graph: {
        node: { title:  "A"  color: blue }
        node: { title:  "B"  color: red  }
        edge: { source: "A"  target: "B" }
       }

 See also
» Your benefits
» User testimonials
» Partial customer list