Fix BidirectionalShortestPath from one node to itself. #36
Description
Analyze the case where the from and to nodes from a ShortestPath are the same. The algorithm should return distance/cost equal to zero. Currently, the algorithm is trapped in a loop.