x,y:Vertices(the_graph). the_obj.eq(x,y) 
x = y
T:Type, s:T, x:Vertices(the_graph), f:(T
Vertices(the_graph)T).
L:Vertices(the_graph) List.
(y:Vertices(the_graph). x-the_graph- > y (y 
L))
& the_obj.eacc(f,s,x) = list_accum(s',x'.f(s',x');s;L)
T:Type, s:T, f:(TVertices(the_graph)T).
L:Vertices(the_graph) List.
no_repeats(Vertices(the_graph);L)
& (y:Vertices(the_graph). (y L))
& the_obj.vacc(f,s) = list_accum(s',x'.f(s',x');s;L)
((inl(i) s) 
(inr(i) s))
L:Vertices(the_graph) List, s:traversal(the_graph).
s2:traversal(the_graph). list_accum(s',j.dfs(the_obj;s';j);s;L) = (s2 @ s)
y:Vertices(the_graph). i-the_graph- > y (y L)
s) (inl(i) s)
([inl(i)] @ s2 @ [inr(i)]) = nil traversal(the_graph)
None
About:
| | | | | | | |
 |  |  |  |  |  |
 |