Daniel@0: .\" -*- nroff -*- Daniel@0: .\" This manual is for graphviz, a rich set of graph drawing tools, and it Daniel@0: .\" can be distributed under the same terms as the graphviz package. Daniel@0: .\" Daniel@0: .\" Copyright (C) 2006 Cyril Brulebois Daniel@0: .\" Daniel@0: .TH GRAPHVIZ 7 "November 19, 2006" Daniel@0: .SH "NAME" Daniel@0: graphviz \- rich set of graph drawing tools Daniel@0: Daniel@0: .SH "SYNOPSIS" Daniel@0: This manpage has been written to fulfil the need of a centralized documentation Daniel@0: presenting all available tools in the graphviz package. Daniel@0: Daniel@0: .SH "AVAILABLE TOOLS" Daniel@0: Daniel@0: .SS "Graph layout programs" Daniel@0: .TP Daniel@0: .B dot Daniel@0: filter for hierarchical layouts of graphs Daniel@0: .TP Daniel@0: .B neato Daniel@0: filter for symmetric layouts of graphs Daniel@0: .TP Daniel@0: .B twopi Daniel@0: filter for radial layouts of graphs Daniel@0: .TP Daniel@0: .B circo Daniel@0: filter for circular layout of graphs Daniel@0: .TP Daniel@0: .B fdp Daniel@0: filter for symmetric layouts of graphs Daniel@0: .PP Daniel@0: All of the filters work with either directed or undirected graphs, though Daniel@0: .B dot Daniel@0: is typically used for directed graphs and Daniel@0: .B neato Daniel@0: for undirected graphs. Daniel@0: Note also that \fBneato \-n[2]\fP can be used to render layouts produced Daniel@0: by the other filters. Daniel@0: .SS "Graph drawing programs" Daniel@0: .TP Daniel@0: .B lefty Daniel@0: A Programmable Graphics Editor Daniel@0: .TP Daniel@0: .B lneato Daniel@0: lefty + neato Daniel@0: .TP Daniel@0: .B dotty Daniel@0: lefty + dot Daniel@0: Daniel@0: Daniel@0: .SS "Graph layout enhancement" Daniel@0: .TP Daniel@0: .B gvcolor Daniel@0: flow colors through a ranked digraph Daniel@0: .TP Daniel@0: .B unflatten Daniel@0: adjust directed graphs to improve layout aspect ratio Daniel@0: .TP Daniel@0: .B gvpack Daniel@0: merge and pack disjoint graphs Daniel@0: Daniel@0: .SS "Graph information and transformation" Daniel@0: .TP Daniel@0: .B gc Daniel@0: count graph components Daniel@0: .TP Daniel@0: .B acyclic Daniel@0: make directed graph acyclic Daniel@0: .TP Daniel@0: .B nop Daniel@0: pretty-print graph file Daniel@0: .TP Daniel@0: .B ccomps Daniel@0: connected components filter for graphs Daniel@0: .TP Daniel@0: .B sccmap Daniel@0: extract strongly connected components of directed graphs Daniel@0: .TP Daniel@0: .B tred Daniel@0: transitive reduction filter for directed graphs Daniel@0: .TP Daniel@0: .B dijkstra Daniel@0: single-source distance filter Daniel@0: .TP Daniel@0: .B bcomps Daniel@0: biconnected components filter for graphs Daniel@0: .TP Daniel@0: .B gvpr Daniel@0: graph pattern scanning and processing language Daniel@0: .TP Daniel@0: .B prune Daniel@0: prune directed graphs Daniel@0: Daniel@0: .SS "Other" Daniel@0: .TP Daniel@0: .B "gxl2dot, dot2gxl" Daniel@0: GXL-DOT converters Daniel@0: Daniel@0: .SH "AUTHOR" Daniel@0: This manual page was written by Cyril Brulebois Daniel@0: in november 2006, based on an initial Daniel@0: documentation effort by Joachim Berdal Haga . It can be Daniel@0: distributed under the same terms as the graphviz package. Daniel@0: