Seth Woolley's Man Viewer

ccomps(1) - ccomps - connected components filter for graphs - man 1 ccomps

([section] manual, -k keyword, -K [section] search, -f whatis)
man plain no title

CCOMPS(1)                                                            CCOMPS(1)



NAME
       ccomps - connected components filter(1,3x,3x curs_util) for graphs

SYNOPSIS
       ccomps [ -sxv?  ] [ -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. Implies the -v flag.

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

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

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

       -n     Do not project subgraph structure. Normally, if(3,n) 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 sub-
              graph is produced.)  If this flag is set(7,n,1 builtins), the component contains
              only the relevant nodes and edges.

       -X node_name
              Prints only the component containing the node node_name, if(3,n) any.

       -X# index
              Prints only component number index, if(3,n) any, starting at 0.

       -o outfile
              If specified, each graph will be written  to  a  different  file(1,n)
              with  the  names derived from outfile. In particular, if(3,n) 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(1,n) 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(5,8)  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(3,n) "_component_" and the number of the component.

OPERANDS
       The following operand is supported:

       files   Names of files containing 1 or more graphs in(1,8) 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(3,n)  all  the  input graphs are connected; and non-zero if(3,n) any graph has
       multiple components, or any error(8,n) occurred.  If just extracting a  sin-
       gle  component,  ccomps  returns  0 on success and non-zero if(3,n) an error(8,n)
       occurred.

BUGS
       It is possible, though unlikely, that the names used for connected com-
       ponents  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)



                                 21 March 2001                       CCOMPS(1)

References for this manual (incoming links)