9.
i:
(||p||-1). p[i]-the_graph- > p[(i+1)]10. p[0] = x
null(p)x,y:Vertices(the_graph). Dec(x = y)
p1:Vertices(the_graph) List.
||p1|| < ||p||
path(the_graph;p1)
p1[0] = x
last(p1) = y x = y 
(
z:Vertices(the_graph). z = x & x-the_graph- > z & z-the_graph- > *y)
null(p)
| 1 | 8. 0 < ||p|| 9. i:(||p||-1). p[i]-the_graph- > p[(i+1)]10. p[0] = x null(p) | 2 steps |
About:
 |  |  |  |  |  |
 |  |  |  |  |