gvcolor(1) [debian man page]

GVCOLOR(1)						      General Commands Manual							GVCOLOR(1)

NAME

       gvcolor - flow colors through a ranked digraph
       ( previously known as colorize )

SYNOPSIS

       gvcolor [ files ]

USAGE

       dot file.dot | gvcolor | dot -T<format>

DESCRIPTION

       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 graph must already have been processed by dot.  Appropriate choice of initial colors yields drawings in which  node
       colors help to emphasize logical relationships between nodes, even when they are spread far apart in the layout.

       Initial	colors must be set externally, using the color attribute of a node.  It is often effective to assign colors to a few key source or
       sink nodes, manually setting their colors by editing the graph file.  Color names are as in dot(1): symbolic names or RGB triples.   It	is
       best  to  choose  some  easily-distinguished  but  related  colors;  not  necessarily  spaced  evenly around the color wheel.  For example,
       blue_green, green, and light_yellow looks better than red, green, blue.

       Certain graph attributes control the gvcolor algorithm.	flow=back reverses the flow of colors from heads to tails.   saturation=.1,.9  (or
       any  two  numbers between 0 and 1) adjusts the color saturation linearly from least to greatest rank.  If Defcolor is set, this color value
       is applied to any node not otherwise colored.

EXIT STATUS

       The following exit values are returned:

       0   Successful completion.

       1   If nodes of the graph do not possess a ``pos'' attribute.

BUGS

       It would be nice to make the program work without relying on an initial pass through dot.

AUTHORS

       Stephen C. North <north@research.att.com>
       Emden R. Gansner <erg@research.att.com>

SEE ALSO

       gc(1), dot(1), gvpr(1), ccomps(1), sccmap(1), tred(1), libgraph(3)

								   21 March 2001							GVCOLOR(1)

SCCMAP(1)                                                     General Commands Manual                                                    SCCMAP(1)

NAME

       sccmap - extract strongly connected components of directed graphs

SYNOPSIS

       sccmap [-dsv] [ -ooutfile ] [ files ]

DESCRIPTION

       sccmap  decomposes  digraphs  into strongly connected components and an auxiliary map of the relationship between components.  In this map,
       each component is collapsed into a node.  The resulting graphs are printed to standard out.  The number of nodes, edges and  strongly  con-
       nected components are printed to standard error.  sccmap is a way of partitioning large graphs into more manageable pieces.

OPTIONS

       The following options are supported:

       -d     Preserve degenerate components of only one node.

       -s     Do not print the resulting graphs. Only the statistics are important.

       -S     Just print the resulting graphs. No statistics are printed.

       -ooutput
              Prints output to the file output. If not given, sccmap uses stdout.

       -v     Generate  additional  statistics.  In  particular, sccmap prints the number of nodes, edges, connected components, and strongly con-
              nected components, followed by the fraction of nodes in a non-trivial strongly connected  components,  the  maximum  degree  of  the
              graph, and fraction of non-tree edges in the graph.

OPERANDS

       The following operand is supported:

       files   Names of files containing 1 or more graphs in dot format.  If no files operand is specified, the standard input will be used.

DIAGNOSTICS

       sccmap emits a warning if it encounters an undirected graph, and ignores it.

AUTHORS

       Stephen C. North <north@research.att.com>
       Emden R. Gansner <erg@research.att.com>

SEE ALSO

       gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), tred(1), libgraph(3)

                                                                   21 March 2001                                                         SCCMAP(1)