|Join the Graphviz open source team!|
|With the explosion of graph-based data, the Graphviz project offers new contributors excellent opportunities to explore new concepts, or enhance tools that thousands of projects already use. We're looking for programmers and technical experts in core algorithms, interactive and command line programs, and rendering. This page provides a list of possible open work. And, of course, we are open to your suggestions. If you are interested, please contact us.|
Graph visualization is a way of representing structural information as diagrams of abstract graphs and networks. It has important applications in networking, bioinformatics, software engineering, database and web design, machine learning, and in visual interfaces for other technical domains.
Graphviz is open source graph visualization software. It has several main layout programs. See the gallery for sample layouts. It also has web and interactive graphical interfaces, and auxiliary tools, libraries, and language bindings. We're not able to put a lot of work into GUI editors but there are quite a few external projects and even commercial tools that incorporate Graphviz. You can find some of these in the Resources section.
The Graphviz layout programs take descriptions of graphs in a simple text language, and make diagrams in useful formats, such as images and SVG for web pages; PDF or Postscript for inclusion in other documents; or display in an interactive graph browser.
Graphviz has many useful features for concrete diagrams, such as options for colors, fonts, tabular node layouts, line styles, hyperlinks, and custom shapes.
In practice, graphs are usually generated from an external data sources, but they can also be created and edited manually, either as raw text files or within a graphical editor. (Graphviz was not intended to be a Visio replacement, so it is probably frustrating to try to use it that way.)
dot - ``hierarchical'' or layered drawings of directed graphs. This is the default tool to use if edges have directionality. dot aims edges in the same direction (top to bottom, or left to right) and then attempts to avoid edge crossings and reduce edge length.
neato - ``spring model'' layouts. This is the default tool to use if the graph is not too large (about 100 nodes) and you don't know anything else about it. Neato attempts to minimize a global energy function, which is equivalent to statistical multi-dimensional scaling. The solution is achieved using stress majorization, though the older Kamada-Kawai algorithm, using steepest descent, is also available. fdp implements the Fruchterman-Reingold heuristic including a multigrid solver that handles larger graphs and clustered undirected graphs.
fdp - ``spring model'' layouts similar to those of neato, but does this by reducing forces rather than working with energy. Fdp implements the Fruchterman-Reingold heuristic including a multigrid solver that handles larger graphs and clustered undirected graphs.
sfdp - multiscale version of fdp for the layout of large graphs.
circo - circular layout, after Six and Tollis 99, Kauffman and Wiese 02. This is suitable for certain diagrams of multiple cyclic structures, such as certain telecommunications networks.
If you have a bug or believe something is not working as expected, please submit a bug report using the form.
John Ellson (for problems with builds, installation, software configuration or this web server)
Emden Gansner (for all graph layout issues)
Yifan Hu (to contribute example graphs)
Arif Bilgin (for Windows-related issues)
Dwight Perry (for website issues)
- Perl script for generating an org chart
17 hours 27 min ago
- restrictions on loading image files
1 day 44 min ago
- You are running dot on the
3 days 40 min ago
- If someone would post a
4 days 28 min ago
- same problem here
4 days 1 hour ago
- Do You have any good solution
6 days 18 hours ago
- A general tutorial can be
1 week 18 hours ago
- The only reason the clickable
1 week 1 day ago
- In addition to what Emden
2 weeks 2 hours ago
- Good news for me
2 weeks 15 hours ago