| if then node i and j are in different connected components. |
| if then there is no path of length k connecting node i and node j. |
| if then there is no path of length shorter than k connecting node i and node j. |
| there could be a path between node i and node j |
| if k is bigger than the amount of vertices node i and node j are in two different connected components. |