2. x: Vertices(the_graph)
3. y: Vertices(the_graph)
4. p: Vertices(the_graph) List
5. path(the_graph;p)
0 < ||p||2. x: Vertices(the_graph)
3. y: Vertices(the_graph)
4. p: Vertices(the_graph) List
5. path(the_graph;p)
null(p)
For any graph
x,y:V. x-the_graph- > *y 
Prop
| 1 | 1. the_graph: Graph 2. x: Vertices(the_graph) 3. y: Vertices(the_graph) 4. p: Vertices(the_graph) List 5. path(the_graph;p) 0 < ||p|| | 1 step |
| 2 | 1. the_graph: Graph 2. x: Vertices(the_graph) 3. y: Vertices(the_graph) 4. p: Vertices(the_graph) List 5. path(the_graph;p) null(p) | 1 step |
About:
 |  |  |  |  |  |