Appendix A Optimal Path Search

For the optimal route search we want to find the shortest path in a modified graph. We adapt the standard Dijkstra's algorithm for the same. A priority queue is maintained for all the unvisited nodes. Each unvisited node is mapped to the minimum cost to reach that node from the source node, using the visited ones. In each iteration the minimum element is popped from the queue and it's neighbours are updated using the negative log likelihoods found from the model and added to the queue (lines 7-11).