1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
(*
* This is the example I used in the PACT '98 paper
*)
structure Test1 =
struct
structure G = DirectedGraph
fun makeDag nodes edges =
let val dag as Graph.GRAPH G = G.graph("Test1",(),10)
in app (fn n => #add_node G (n,n)) nodes;
app (#add_edge G) edges;
dag
end
val dag = makeDag [1,2,3,4,5,6,7,8]
[(1,2,0),
(1,4,0),
(2,3,0),
(2,5,0),
(4,3,1),
(4,5,1),
(3,6,1),
(7,6,0)
]
fun close dag =
TransitiveClosure.acyclic_transitive_closure2
{+ = fn(i,j) => i+j+1,
max = Int.max
} dag
fun palemSimons (dag as Graph.GRAPH G) =
let val dag' as Graph.GRAPH G' = G.graph("Tmp",(),10)
val _ = #forall_nodes G (#add_node G')
val _ = #forall_edges G (#add_edge G')
in PalemSimons.rank{dag = dag',
l = fn(_,_,l) => l,
d = fn _ => 10,
m = 1
}
end
structure View = GraphViewerFn(daVinci)
structure L = GraphLayout
fun view dag =
View.view(
L.makeLayout{node=fn(n,_)=>[L.LABEL(Int.toString n)],
edge=fn(i,j,l)=>[L.LABEL(Int.toString l),L.COLOR "red"],
graph=fn _ =>[]} dag
)
end
|
