Identifying Dijkstra's algorithm for shortest path

Dijkstra's algorithm can solve the shortest path problems for weighted graphs with non-negative weights. These are generally medium or hard problems where we need to find the shortest distance between any pair of nodes in a weighted graph. While we may be able to solve the problem using other shortest path algorithms like Bellman-Ford, they are usually less efficient for these specific problems.

If the problem statement or its solution follows the generic template below, it can be solved by applying Dijkstra's algorithm.