MetaXearch > / Math / Combinatorics / Software / Graph Drawing /
GDToolkit - a Graph Drawing Toolkit
GDToolkit (also known as GDT) is a Graph Drawing Toolkit designed to efficiently manipulate several types of graph, and to automatically draw them according to many different aesthetic criteria and constraints. (infos)graphdrawing.org
Information source for researchers, practitioners, developers, and users working on all aspects of graph visualization and representation. (infos)
Tom Sawyer Software
Graph analysis and visualization component software for ActiveX, C++, Java, JSP, MFC and .NET. Free trial download. (infos)
Pajek - a Package for Large Network Analysis
This program runs under Windows NT/9x and provides some analysis tools for large networks and graph-drawing capabilities. (infos)
Graphlet
A toolkit for graph editors and graph algorithms. Unix and Win32 binaries for free download. (infos)
aiSee Graph Layout Software
aiSee automatically calculates a customizable layout of graphs specified in GDL (graph description language). aiSee supports 15 basic graph layout algorithms, recursive subgraph nesting, fish-eye views and easy printing. It has been optimized to handle large graphs automatically generated by applications (e.g. compilers). (infos)
Tulip
System dedicated to the visualization of huge graphs. It manages graphs with a number of elements (nodes and edges) up to 500,000 on a personal computer. It features 3D visualization and modification. GPL. (infos)
PIGALE - Public Implementation of a Graph Algorithm Library and Editor
PIGALE is a graph editor and an algorithm library essentially concerned with planar graphs. Written in C++ and interfaced with the Qt library, it is particularly intended for graph theoretical research. PIGALE is released under GPL. (infos)
yFiles - the Java Graph Drawing Library
yFiles is an extensive Java class library that provides algorithms and components for analyzing, viewing and layouting graphs, diagrams and networks. (infos)
AGD - Algorithms for Graph Drawing
AGD offers a broad range of existing algorithms for two-dimensional graph drawing and tools for implementing new algorithms. It is a product of a cooperation of groups in Halle, Köln, and Saarbrücken supported by the DFG in the program "Design, Analysis, Implementation, and Evaluation of Graph Drawing Algorithms". (infos)