gvcolor(1) [xfree86 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)

CCOMPS(1)						      General Commands Manual							 CCOMPS(1)

NAME

       ccomps - connected components filter for graphs

SYNOPSIS

       ccomps [ -sxvnzC?  ] [ -X[#]v ] [ -ooutfile ] [ files ]

DESCRIPTION

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

OPTIONS

       The following options are supported:

       -s     No output graph is printed. The return value can be used to check if the graph is connected or not.

       -x     Only the connected components are printed, as separate graphs.

       -v     Counts of nodes, edges and connected components are printed.

       -z     Sort components by size, with the largest first. This is only effective if either -x or -X#v is present.	Thus, -zX#0 will cause the
	      largest component to be printed.

       -C     Use clusters in computing components in addition to normal edge connectivity. In essence, this gives the connected components of the
	      derived graph in which nodes top-level clusters and nodes in the original graph. This maintains all subgraph structure within a com-
	      ponent, even if a subgraph does not contain any nodes.

       -n     Do not project subgraph structure. Normally, if ccomps produces components as graphs distinct from the input graph, it  will  define
	      subgraphs which are projections of subgraphs of the input graph onto the component. (If the projection is empty, no subgraph is pro-
	      duced.)  If this flag is set, the component contains only the relevant nodes and edges.

       -X node_name
	      Prints only the component containing the node node_name, if any.

       -X# index
	      Prints only component number index, if any, starting at 0.

       -o outfile
	      If specified, each graph will be written to a different file with the names derived from outfile. In particular, if both -o  and	-x
	      flags are used, then each connected component is written to a different file. If outfile does not have a suffix, the first file will
	      have the name outfile; then next outfile_1, then next outfile_2, and so on.  If outfile has a suffix, i.e., has the  form  base.sfx,
	      then the files will be named base.sfx, base_1.sfx, base_2.sfx, etc.

       By default, each input graph is printed, with each connected component given as a subgraph whose name is a concatenation of the name of the
       input graph, the string "_component_" and the number of the component.

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.

RETURN CODES

       Unless used to extract a single connected component, ccomps returns 0 if all the input graphs are connected; and non-zero if any graph  has
       multiple  components,  or  any error occurred.  If just extracting a single component, ccomps returns 0 on success and non-zero if an error
       occurred.

BUGS

       It is possible, though unlikely, that the names used for connected components and their	subgraphs  may	conflict  with	existing  subgraph
       names.

AUTHORS

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

SEE ALSO

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

								  27 August 2008							 CCOMPS(1)