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
55
56
57
58
59
60
61
62
63
64
65
66
67
|
(*
* Graph isomorphism view. This works like the map function on lists.
*
* -- Allen
*)
signature ISOMORPHIC_GRAPH_VIEW =
sig
val map : ('n Graph.node -> 'N) ->
('e Graph.edge -> 'E) ->
('g -> 'G) ->
('n,'e,'g) Graph.graph ->
('N,'E,'G) Graph.graph
end
structure IsomorphicGraphView : ISOMORPHIC_GRAPH_VIEW =
struct
structure G = Graph
fun map P Q R (G.GRAPH G) =
let fun rename_node f (i,n) = f(i,P(i,n))
fun rename_node' (i,n) = (i,P(i,n))
fun rename_edge f (i,j,e) = f(i,j,Q(i,j,e))
fun rename_edge' (i,j,e) = (i,j,Q(i,j,e))
fun rename_edges es = List.map rename_edge' es
fun unimplemented _ = raise G.Unimplemented
in
G.GRAPH
{ name = #name G,
graph_info = R(#graph_info G),
new_id = unimplemented,
add_node = unimplemented,
add_edge = unimplemented,
remove_node = unimplemented,
set_in_edges = unimplemented,
set_out_edges = unimplemented,
set_entries = unimplemented,
set_exits = unimplemented,
garbage_collect = #garbage_collect G,
nodes = fn () => List.map rename_node' (#nodes G ()),
edges = fn () => rename_edges (#edges G ()),
order = #order G,
size = #size G,
capacity = #capacity G,
out_edges = fn i => rename_edges (#out_edges G i),
in_edges = fn i => rename_edges (#in_edges G i),
succ = #succ G,
pred = #pred G,
has_edge = #has_edge G,
has_node = #has_node G,
node_info = fn i => P(i,#node_info G i),
entries = #entries G,
exits = #exits G,
entry_edges = fn i => rename_edges (#entry_edges G i),
exit_edges = fn i => rename_edges (#exit_edges G i),
forall_nodes = fn f => #forall_nodes G (rename_node f),
forall_edges = fn f => #forall_edges G (rename_edge f)
(*
fold_nodes = fold_nodes,
fold_edges = fold_edges
*)
}
end
end
|
