I have learnt the dijkstra’s algorithm and I can implement it to find the shortest path on a weighted undirected graph. But is there a way to find the shortest path on a directed graph with dijktra or do I need another algorithm?
Thanks in advance to any response