mapoutl(L5))
(j s2) mapoutl(L3@0)) (j s2)
i:Vertices(the_graph). (i L)
i:Vertices(the_graph). (i L) 
(inr(i) dfsl(the_obj;L)) & (inl(i) dfsl(the_obj;L))
L1,L2:Vertices(the_graph) List.
L = (L1 @ L2)
(
s1,s2:Vertices(the_graph) List.
topsortl(the_obj;L) = (s2 @ s1)
& (j:Vertices(the_graph).
((j s1) 
L1-the_graph- > *j) & ((j s2) L2-the_graph- > *j & 
L1-the_graph- > *j)))
i:Vertices(the_graph), s1,s2:traversal(the_graph).
(j:Vertices(the_graph). i-the_graph- > *j non-trivial-loop(the_graph;j))
dfsl(the_obj;L) = (s1 @ [inl(i)] @ s2)
(j:Vertices(the_graph). j = i i-the_graph- > *j (inl(j) s2))
(Vertices(the_graph)+Vertices(the_graph)) List
j = i
L5 @ L3@0)
(j s2)
L1,L2:(A+B) List. mapoutl(L1 @ L2) ~ (mapoutl(L1) @ mapoutl(L2))
-1
x:T, l1,l2:T List. (x l1 @ l2) (x l1) 
(x l2)
-1
| 1 | 31. (j mapoutl(L5)) (j s2) | 1 step |
| 2 | 31. (j mapoutl(L3@0)) (j s2) | 1 step |
About:
 |  |  |  |  |  |  |  |
 |  |  |  |  |  |