Path Finding

1) You need to get to the end point by going through the largest number of vertices, and each vertex can be visited exactly once.

2) Find the shortest path to the end point, passing the vertices once and calculating the total cost of the path so that it is minimal.

3) Go through each side of the figure exactly once, and each vertex can be visited as many times as you want.