Dijkstra

Medium

Dijkstra

Algorithm to find the shortest paths from a source to all other nodes in a weighted graph.

GraphShortest PathPriority Queue

Dijkstra is a shortest path algorithm that expands the map by choosing the "least cost path" step by step.

1/33

Set start A distance to 0, others to infinity(∞).

🔒

Medium

Dijkstra

Algorithm to find the shortest paths from a source to all other nodes in a weighted graph.

GraphShortest PathPriority Queue

Dijkstra is a shortest path algorithm that expands the map by choosing the "least cost path" step by step.

1/33

Set start A distance to 0, others to infinity(∞).

🔒