|
|
1.1 root 1: Dag \(em A Program for Drawing Directed Graphs g
2: GD S
3: GE S
4: GS S
5: ~dags
6: ~drawings
7: ~crossings
8: ~strings
9: ~gsave
10: Basics s
11: Node Attributes s
12: Node Shapes s
13: Node Labels s
14: Node Colors s
15: Edge Attributes s
16: Edge Labels s
17: Edge Weights s
18: Edge Styles s
19: Edge Colors s
20: Spacing Control s
21: Rank Assignment Control s
22: Drawing Algorithms
23: ShadedBox S
24: backedge S
25: backpath S
26: separate S
27: acyclic graphs
28: bounding box
29: code generator
30: default attributes s
31: directed graphs g
32: draw dag
33: dummy node s
34: edge crossing s
35: edge statements p
36: GD line p
37: graph description
38: incident edges s
39: invisible flat-edges s
40: maximum rank S
41: minimum rank S
42: optimal rank assignment s
43: running time s
44: spline control points
45: troff c
46: \*(PC C
47: \*(PO
48: draw nodes S
49: Plaintext S
50: Box S
51: Square S
52: Circle S
53: Doublecircle S
54: Ellipse S
55: Diamond S
56: user-defined shapes s
57: dagsetcolor S
58: draw edges S
59: line style s
60: seperate S
61: same rank S
62: ordered edge S
63: draw_dag S
64: \fIPath\fP statements p
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.