3.5 Graph - 3.5.4 Dijkstra’s Algorithm

CS - 3. Common Algorithms - 3.5 Graph - 3.5.4 Dijkstra's Algorithm Dijkstra’s Algorithm 💡Dijkstra’s algorithm is a graph traversal algorithm that finds the shortest path between two nodes in a graph. It is a weighted graph algorithm, meaning that each edge in the graph has a weight associated with it. The algorithm works by finding the shortest path from the starting node to all other nodes in t..

2024.01.30