6. path(the_graph;p)
7. p[0] = x
8. last(p) = y
x = y 
(
z:Vertices(the_graph). 
z = x & x-the_graph- > z & z-the_graph- > *y)
x,y:Vertices(the_graph). Dec(x = y)
x = y (z:Vertices(the_graph). z = x & x-the_graph- > z & z-the_graph- > *y)
| 1 | 5. p: Vertices(the_graph) List 6. path(the_graph;p) 7. p[0] = x 8. last(p) = y x = y (z:Vertices(the_graph). z = x & x-the_graph- > z & z-the_graph- > *y) | 23 steps |
About:
 |  |  |  |  |  |