Graph Visualization Tools

A collection of tools for the manipulation and layout of graphs (as in nodes

and edges, not as in barcharts).

acyclic

acyclic is a filter that takes a directed graph as input and outputs a copy of the graph with sufficient edges reversed to make the graph acyclic. The reversed...

acyclic is a filter that takes a directed graph as input and outputs a copy of the graph with sufficient edges reversed to make the graph acyclic. The reversed...

bcomps

bcomps decomposes graphs into their biconnected components, printing the components to standard output.

bcomps decomposes graphs into their biconnected components, printing the components to standard output.

ccomps

ccomps decomposes graphs into their connected components, printing the components to standard output.

ccomps decomposes graphs into their connected components, printing the components to standard output.

cluster

cluster takes as input a graph in DOT format, finds node clusters and augments the graph with this information. The clusters are specified by the "cluster"...

cluster takes as input a graph in DOT format, finds node clusters and augments the graph with this information. The clusters are specified by the "cluster"...

diffimg

diffimg generates an image where each pixel is the difference between the corresponding pixel in each of the two source images. Thus, if the source images are...

diffimg generates an image where each pixel is the difference between the corresponding pixel in each of the two source images. Thus, if the source images are...

dijkstra

dijkstra reads a stream of graphs and for each computes the distance of every node from sourcenode. Edge length is given in the len attribute, and the default...

dijkstra reads a stream of graphs and for each computes the distance of every node from sourcenode. Edge length is given in the len attribute, and the default...

dot

These are a collection of programs for drawing graphs. There is actually only one main program; the specific layout algorithms implemented as plugins. Thus...

These are a collection of programs for drawing graphs. There is actually only one main program; the specific layout algorithms implemented as plugins. Thus...

dotty

dotty is a graph editor for the X Window System. It may be run as a standalone editor, or as a front end for applications that use graphs. It can control...

dotty is a graph editor for the X Window System. It may be run as a standalone editor, or as a front end for applications that use graphs. It can control...

edgepaint

edgepaint takes as input a graph in DOT format with node position information (the pos attribute) and colors the edges in a manner making it easier to tell them...

edgepaint takes as input a graph in DOT format with node position information (the pos attribute) and colors the edges in a manner making it easier to tell them...

gc

gc is a graph analogue to wc in that it prints to standard output the number of nodes, edges, connected components or clusters contained in the input files. It...

gc is a graph analogue to wc in that it prints to standard output the number of nodes, edges, connected components or clusters contained in the input files. It...

gml2gv

gml2gv converts a graph specified in the GML format to a graph in the GV (formerly DOT) format. gv2gml converts a graph specified in the GV format to a graph in...

gml2gv converts a graph specified in the GML format to a graph in the GV (formerly DOT) format. gv2gml converts a graph specified in the GV format to a graph in...

graphml2gv

graphml2gv converts a graph specified in the GRAPHML format to a graph in the GV (formerly DOT) format.

graphml2gv converts a graph specified in the GRAPHML format to a graph in the GV (formerly DOT) format.

gvcolor

gvcolor is a filter that sets node colors from initial seed values. Colors flow along edges from tail to head, and are averaged (as HSB vectors) at nodes. The...

gvcolor is a filter that sets node colors from initial seed values. Colors flow along edges from tail to head, and are averaged (as HSB vectors) at nodes. The...

gvmap

gvmap takes as input a graph in DOT format, finds node clusters and produces a rendering of the graph as a geographic-style map, with clusters highlighted as...

gvmap takes as input a graph in DOT format, finds node clusters and produces a rendering of the graph as a geographic-style map, with clusters highlighted as...

gvmap.sh

gvmap.sh takes as input a graph in DOT format, performs a layout, runs the output through gvmap and renders the output. At some point, it is hoped to integrate...

gvmap.sh takes as input a graph in DOT format, performs a layout, runs the output through gvmap and renders the output. At some point, it is hoped to integrate...

gvpack

gvpack reads in a stream of graphs, combines the graphs into a single layout, and produces a single graph serving as the union of the input graphs. The input...

gvpack reads in a stream of graphs, combines the graphs into a single layout, and produces a single graph serving as the union of the input graphs. The input...

gvpr

gvpr (previously known as gpr) is a graph stream editor inspired by awk. It copies input graphs to its output, possibly transforming their structure and...

gvpr (previously known as gpr) is a graph stream editor inspired by awk. It copies input graphs to its output, possibly transforming their structure and...

gxl2gv

gxl2gv converts between graphs represented in GXL and in the GV language. Unless a conversion type is specified using a flag, gxl2gv will deduce the type of...

gxl2gv converts between graphs represented in GXL and in the GV language. Unless a conversion type is specified using a flag, gxl2gv will deduce the type of...

lefty

lefty is a two-view graphics editor for technical pictures. This editor has no hardwired knowledge about specific picture layouts or editing operations. Each...

lefty is a two-view graphics editor for technical pictures. This editor has no hardwired knowledge about specific picture layouts or editing operations. Each...

lneato

lneato is a graph editor for the X Window System. It may be run as a standalone editor, or as a front end for applications that use graphs. It can control...

lneato is a graph editor for the X Window System. It may be run as a standalone editor, or as a front end for applications that use graphs. It can control...

mm2gv

mm2gv converts a sparse matrix of the Matrix Market format to a graph in the GV (formerly DOT) format. If the matrix M is not square, the graph is considered...

mm2gv converts a sparse matrix of the Matrix Market format to a graph in the GV (formerly DOT) format. If the matrix M is not square, the graph is considered...

nop

nop reads a stream of graphs and prints each in pretty-printed (canonical) format on stdout. If no files are given, it reads from stdin.

nop reads a stream of graphs and prints each in pretty-printed (canonical) format on stdout. If no files are given, it reads from stdin.

osage

osage draws clustered graphs. As input, it takes any graph in the dot format. It draws the graph recursively. At each level, there will be a collection of nodes...

osage draws clustered graphs. As input, it takes any graph in the dot format. It draws the graph recursively. At each level, there will be a collection of nodes...

patchwork

patchwork draws clustered graphs using a squarified treemap layout. As input, it takes any graph in the dot format. Each cluster is given an area based on the...

patchwork draws clustered graphs using a squarified treemap layout. As input, it takes any graph in the dot format. Each cluster is given an area based on the...

prune

prune reads directed graphs in the same format used by dot(1) and removes subgraphs rooted at nodes specified on the command line via options. These nodes...

prune reads directed graphs in the same format used by dot(1) and removes subgraphs rooted at nodes specified on the command line via options. These nodes...

sccmap

sccmap decomposes digraphs into strongly connected components and an auxiliary map of the relationship between components. In this map, each component is...

sccmap decomposes digraphs into strongly connected components and an auxiliary map of the relationship between components. In this map, each component is...

tred

tred computes the transitive reduction of directed graphs, and prints the resulting graphs to standard output. This removes edges implied by transitivity. Nodes...

tred computes the transitive reduction of directed graphs, and prints the resulting graphs to standard output. This removes edges implied by transitivity. Nodes...

unflatten

unflatten is a preprocessor to dot that is used to improve the aspect ratio of graphs having many leaves or disconnected nodes. The usual layout for such a...

unflatten is a preprocessor to dot that is used to improve the aspect ratio of graphs having many leaves or disconnected nodes. The usual layout for such a...

vimdot

vimdot is a simple script which launches the gvim or vim editor along with a GUI window showing the dot output of the edited file. The dot output window...

vimdot is a simple script which launches the gvim or vim editor along with a GUI window showing the dot output of the edited file. The dot output window...

graphviz

This manpage has been written to fulfil the need of a centralized documentation presenting all available tools in the graphviz package.

This manpage has been written to fulfil the need of a centralized documentation presenting all available tools in the graphviz package.