1BCOMPS(1)                   General Commands Manual                  BCOMPS(1)
2
3
4

NAME

6       bcomps - biconnected components filter for graphs
7

SYNOPSIS

9       bcomps [ -stvx?  ] [ -ooutfile ] [ files ]
10

DESCRIPTION

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

OPTIONS

16       The following options are supported:
17
18       -s     No output graph is printed. Implies the -v flag.
19
20       -t     Print the underlying block-cutvertex tree.
21
22       -x     Each biconnected component is printed as a separate root graph.
23
24       -v     Prints number of blocks and cutvertices.
25
26       -o outfile
27              If specified, each root graph will be  written  to  a  different
28              file with the names derived from outfile. In particular, if both
29              -o and -x flags are used, then each block is written to  a  dif‐
30              ferent file. If outfile does not have a suffix, the nth block of
31              the ith graph is written to outfile_n_i. However, the 0th  block
32              of the 0th graph is written to outfile.
33
34              If  outfile  has a suffix, i.e., has the form base.sfx, then the
35              files will have the same name as  above,  except  appended  with
36              .sfx.
37
38              The block-cutvertex tree of ith graph is written to outfile_n_T,
39              with an appended suffix if specified.
40
41       By default, each input graph is printed, with each  block  given  as  a
42       subgraph  whose name is a concatenation of the name of the input graph,
43       the string "_bcc_" and the number of the block.
44

OPERANDS

46       The following operand is supported:
47
48       files   Names of files containing 1 or more graphs in dot  format.   If
49               no files operand is specified, the standard input will be used.
50

RETURN CODES

52       bcomps  returns 0 if all the input graphs are biconnected; and non-zero
53       if any graph has multiple blocks, or any error occurred.
54

BUGS

56       It is possible, though unlikely, that the names used for connected com‐
57       ponents and their subgraphs may conflict with existing subgraph names.
58

AUTHORS

60       Emden R. Gansner <erg@research.att.com>
61

SEE ALSO

63       ccomps(1),  gc(1),  dot(1), gvpr(1), gvcolor(1), acyclic(1), sccmap(1),
64       tred(1), libgraph(3)
65
66
67
68                               18 November 2003                      BCOMPS(1)
Impressum