1
.TH COLORIZE 1 "21 March 2001"
3
colorize \- flow colors through a ranked digraph
11
dot file.dot | colorize | dot -T\fI<format>\fP
15
is a filter that sets node colors from initial seed values.
16
Colors flow along edges from tail to head, and are averaged
17
(as HSB vectors) at nodes.
18
\fIThe graph must already have been processed by dot.\fP
19
Appropriate choice of initial colors yields drawings in which node
20
colors help to emphasize logical relationships between nodes, even
21
when they are spread far apart in the layout.
23
Initial colors must be set externally, using the \fBcolor\fP
24
attribute of a node. It is often effective to
25
assign colors to a few key source or sink nodes, manually setting
26
their colors by editing the graph file.
27
Color names are as in \fIdot(1)\fP: symbolic names or RGB triples.
28
It is best to choose some easily-distinguished but related colors;
29
not necessarily spaced evenly around the color wheel. For example,
30
blue_green, green, and light_yellow looks better than red, green, blue.
32
Certain graph attributes control the \fIcolorizef\P algorithm.
33
\fBflow=back\fP reverses the flow of colors from heads to tails.
34
\fBsaturation=.1,.9\fP (or any two numbers between 0 and 1)
35
adjusts the color saturation linearly from least to greatest rank.
36
If \fBDefcolor\fP is set, this color value is applied to any
37
node not otherwise colored.
39
The following exit values are returned:
42
Successful completion.
45
If nodes of the graph do not possess a ``pos'' attribute.
47
It would be nice to make the program work without relying on
48
an initial pass through \fBdot\fP.
50
Stephen C. North <north@research.att.com>
52
Emden R. Gansner <erg@research.att.com>
54
gc(1), dot(1), gpr(1), ccomps(1), sccmap(1), tred(1), libgraph(3)