|
|
1.1 root 1: .GS 10 7
2: draw nodes pointsize 80 as Box;
3: separate ranks 12;
4: separate nodes 1;
5: draw_dag dag_start ;
6: dag_start deledges ;
7: dag_start setunion ;
8: setunion findroot ;
9: findroot findroot ;
10: dag_start findroot ;
11: dag_start dfs ;
12: dfs noedge ;
13: dfs multiple ;
14: dfs dfs ;
15: draw_dag dag_levels ;
16: dag_levels setlevels ;
17: setlevels addedge ;
18: setlevels networksimplex ;
19: networksimplex initlevel ;
20: initlevel bfs ;
21: networksimplex spantree ;
22: spantree delete_edge ;
23: spantree insert_edge ;
24: spantree spantree ;
25: networksimplex treevalue ;
26: treevalue cutset ;
27: cutset cutset ;
28: networksimplex cutset ;
29: networksimplex treeupdate ;
30: treeupdate treeupdate ;
31: networksimplex delete_edge ;
32: networksimplex insert_edge ;
33: dag_levels balance ;
34: draw_dag dag_unitedges ;
35: draw_dag dag_ranks ;
36: dag_ranks flatclosure ;
37: flatclosure flatedges ;
38: flatedges flatedges ;
39: dag_ranks decompose ;
40: decompose deledges ;
41: dag_ranks buildrank ;
42: buildrank initrank ;
43: initrank reorder ;
44: reorder postorder ;
45: postorder postorder ;
46: buildrank crossinvert ;
47: crossinvert rcross ;
48: buildrank transpose ;
49: transpose left2right ;
50: transpose vcross ;
51: buildrank copyrank ;
52: buildrank mincross ;
53: mincross copyrank ;
54: mincross crossinvert ;
55: mincross median ;
56: median qsort ;
57: median invertcmp ;
58: median mediansort ;
59: mediansort left2right ;
60: mincross transpose ;
61: mincross rcross ;
62: dag_ranks crossinvert ;
63: dag_ranks deledges ;
64: draw_dag dag_positions ;
65: dag_positions bestposition ;
66: bestposition edgefactor ;
67: bestposition dag_simplex ;
68: dag_simplex FindCol ;
69: dag_simplex FindRow ;
70: dag_simplex MergeRows ;
71: dag_simplex readresults ;
72: dag_positions goodposition ;
73: goodposition edgevalue ;
74: goodposition edgefactor ;
75: goodposition qsort ;
76: goodposition prioritycmp ;
77: goodposition define_median ;
78: define_median qsort ;
79: define_median poscmp ;
80: goodposition rlength ;
81: goodposition medianpos ;
82: medianpos widthof ;
83: goodposition singlenode ;
84: singlenode qsort ;
85: singlenode mediancmp ;
86: singlenode vlength ;
87: goodposition verticalcut ;
88: verticalcut qsort ;
89: dag_positions levelposition ;
90: levelposition vsepar ;
91: dag_positions smoothedges ;
92: smoothedges straight ;
93: dag_positions rlength ;
94: draw_dag dag_end ;
95: dag_end partitionedges ;
96: partitionedges between ;
97: dag_end makespline ;
98: makespline dag_spline ;
99: dag_spline flatedge ;
100: flatedge straightedge ;
101: straightedge addpoint ;
102: flatedge sqrt ;
103: flatedge fabs ;
104: flatedge addpoint ;
105: dag_spline selfedge ;
106: selfedge addpoint ;
107: dag_spline defineline ;
108: dag_spline lineXselfedge ;
109: dag_spline lineXbox ;
110: dag_spline addpoint ;
111: dag_end qsort ;
112: dag_end adjcmp ;
113: dag_end dag_fixspline ;
114: dag_fixspline defineline ;
115: dag_fixspline lineXselfedge ;
116: dag_fixspline lineXbox ;
117: dag_fixspline addpoint ;
118: dag_end deledges ;
119: .GE
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.