Dijkstra's algorithm finds the shortest path between two vertices in a graph. It assigns initial distance labels to the start vertex of 0 and temporary labels to other vertices. It then calculates the shortest distances between the start vertex and all other vertices in the graph.