Introduction - If you have any usage issues, please Google them yourself
consisting of n vertex complete graph, and a point of departure from and return to the point of the shortest path is given followed by the shortest path through the vertex and the length of the shortest path.