there as 2 classes 1 with 2 methods and one with 3 methods . the first class requires you to check that there is a route from the start node to the goal node and the second method requires you ro check if there is a route to the goal node from any node in the graph that can be reached from the start node. The second classes 1st method requires you to find the shortest route and the second requires you to find the probability of an unskilled player finding the shortest route and then the third class reuiresz you to find the probability of a skilled player finding the shortest route.
the code includes the tests classes which make graphs to test the code on .
the code is too big to upload so i will email to the bidder