|
Daniel@0
|
1 .TH CCOMPS 1 "27 August 2008"
|
|
Daniel@0
|
2 .SH NAME
|
|
Daniel@0
|
3 ccomps \- connected components filter for graphs
|
|
Daniel@0
|
4 .SH SYNOPSIS
|
|
Daniel@0
|
5 .B ccomps
|
|
Daniel@0
|
6 [
|
|
Daniel@0
|
7 .B \-sxvnzC?
|
|
Daniel@0
|
8 ]
|
|
Daniel@0
|
9 [
|
|
Daniel@0
|
10 .BI -X [#]v
|
|
Daniel@0
|
11 ]
|
|
Daniel@0
|
12 [
|
|
Daniel@0
|
13 .BI -o outfile
|
|
Daniel@0
|
14 ]
|
|
Daniel@0
|
15 [
|
|
Daniel@0
|
16 .I files
|
|
Daniel@0
|
17 ]
|
|
Daniel@0
|
18 .SH DESCRIPTION
|
|
Daniel@0
|
19 .B ccomps
|
|
Daniel@0
|
20 decomposes graphs into their connected components,
|
|
Daniel@0
|
21 printing the components to standard output.
|
|
Daniel@0
|
22 .SH OPTIONS
|
|
Daniel@0
|
23 The following options are supported:
|
|
Daniel@0
|
24 .TP
|
|
Daniel@0
|
25 .B \-s
|
|
Daniel@0
|
26 No output graph is printed. The return value can be used to
|
|
Daniel@0
|
27 check if the graph is connected or not.
|
|
Daniel@0
|
28 .TP
|
|
Daniel@0
|
29 .B \-x
|
|
Daniel@0
|
30 Only the connected components are printed, as separate graphs.
|
|
Daniel@0
|
31 .TP
|
|
Daniel@0
|
32 .B \-v
|
|
Daniel@0
|
33 Counts of nodes, edges and connected components are printed.
|
|
Daniel@0
|
34 .TP
|
|
Daniel@0
|
35 .B \-z
|
|
Daniel@0
|
36 Sort components by size, with the largest first. This is only
|
|
Daniel@0
|
37 effective if either \fB-x\fP or \fB-X#v\fP is present.
|
|
Daniel@0
|
38 Thus, \fB-zX#0\fP will cause the largest component to be printed.
|
|
Daniel@0
|
39 .TP
|
|
Daniel@0
|
40 .B \-C
|
|
Daniel@0
|
41 Use clusters in computing components in addition to normal edge
|
|
Daniel@0
|
42 connectivity. In essence, this gives the connected components of the
|
|
Daniel@0
|
43 derived graph in which nodes top-level clusters and nodes in the
|
|
Daniel@0
|
44 original graph. This maintains all subgraph structure within a
|
|
Daniel@0
|
45 component, even if a subgraph does not contain any nodes.
|
|
Daniel@0
|
46 .TP
|
|
Daniel@0
|
47 .B \-n
|
|
Daniel@0
|
48 Do not project subgraph structure. Normally, if
|
|
Daniel@0
|
49 .B ccomps
|
|
Daniel@0
|
50 produces components as graphs distinct from the input graph, it will
|
|
Daniel@0
|
51 define subgraphs which are projections of subgraphs of the input graph
|
|
Daniel@0
|
52 onto the component. (If the projection is empty, no subgraph is produced.)
|
|
Daniel@0
|
53 If this flag is set, the component contains only the relevant nodes and
|
|
Daniel@0
|
54 edges.
|
|
Daniel@0
|
55 .TP
|
|
Daniel@0
|
56 .BI \-X " node_name"
|
|
Daniel@0
|
57 Prints only the component containing the node \fInode_name\fP,
|
|
Daniel@0
|
58 if any.
|
|
Daniel@0
|
59 .TP
|
|
Daniel@0
|
60 .BI \-X# " index"
|
|
Daniel@0
|
61 Prints only component number \fIindex\fP, if any, starting at 0.
|
|
Daniel@0
|
62 .TP
|
|
Daniel@0
|
63 .BI \-o " outfile"
|
|
Daniel@0
|
64 If specified, each graph will be written to a different file
|
|
Daniel@0
|
65 with the names derived from \fIoutfile\fP. In particular,
|
|
Daniel@0
|
66 if both \fB-o\fP and \fB-x\fP flags are used, then each connected
|
|
Daniel@0
|
67 component is written to a different file. If \fIoutfile\fP does
|
|
Daniel@0
|
68 not have a suffix, the first file will have the name \fIoutfile\fP;
|
|
Daniel@0
|
69 then next \fIoutfile_1\fP, then next \fIoutfile_2\fP, and so on.
|
|
Daniel@0
|
70 If \fIoutfile\fP has a suffix, i.e., has the form \fIbase.sfx\fP,
|
|
Daniel@0
|
71 then the files will be named \fIbase.sfx\fP, \fIbase_1.sfx\fP,
|
|
Daniel@0
|
72 \fIbase_2.sfx\fP, etc.
|
|
Daniel@0
|
73 .LP
|
|
Daniel@0
|
74 By default, each input graph is printed, with each connected
|
|
Daniel@0
|
75 component given as a subgraph whose name is a concatenation of
|
|
Daniel@0
|
76 the name of the input graph, the string "_component_" and the
|
|
Daniel@0
|
77 number of the component.
|
|
Daniel@0
|
78 .SH OPERANDS
|
|
Daniel@0
|
79 The following operand is supported:
|
|
Daniel@0
|
80 .TP 8
|
|
Daniel@0
|
81 .I files
|
|
Daniel@0
|
82 Names of files containing 1 or more graphs in dot format.
|
|
Daniel@0
|
83 If no
|
|
Daniel@0
|
84 .I files
|
|
Daniel@0
|
85 operand is specified,
|
|
Daniel@0
|
86 the standard input will be used.
|
|
Daniel@0
|
87 .SH RETURN CODES
|
|
Daniel@0
|
88 Unless used to extract a single connected component,
|
|
Daniel@0
|
89 .B ccomps
|
|
Daniel@0
|
90 returns
|
|
Daniel@0
|
91 .B 0
|
|
Daniel@0
|
92 if all the input graphs are connected; and
|
|
Daniel@0
|
93 non-zero if any graph has multiple components, or any error occurred.
|
|
Daniel@0
|
94 If just extracting a single component,
|
|
Daniel@0
|
95 .B ccomps
|
|
Daniel@0
|
96 returns
|
|
Daniel@0
|
97 .B 0
|
|
Daniel@0
|
98 on success and non-zero if an error occurred.
|
|
Daniel@0
|
99 .SH "BUGS"
|
|
Daniel@0
|
100 It is possible, though unlikely, that the names used for connected
|
|
Daniel@0
|
101 components and their subgraphs may conflict with existing subgraph names.
|
|
Daniel@0
|
102 .SH AUTHORS
|
|
Daniel@0
|
103 Stephen C. North <north@research.att.com>
|
|
Daniel@0
|
104 .br
|
|
Daniel@0
|
105 Emden R. Gansner <erg@research.att.com>
|
|
Daniel@0
|
106 .SH "SEE ALSO"
|
|
Daniel@0
|
107 gc(1), dot(1), gvpr(1), gvcolor(1), acyclic(1), sccmap(1), tred(1), libgraph(3)
|
