Grokking Graph Algorithms for Coding Interviews
Ask Author
Back to course home

0% completed

Vote For New Content
Dijkstra's Algorithm
Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Dijkstra’s Algorithm is a famous algorithm used to find the shortest path from a source node to all other nodes in a graph. It was created by Edsger W. Dijkstra in 1956. This algorithm is commonly used in network routing protocols and geographic information systems (GIS).

Key Points

  • It finds the shortest path from a single source node to all other nodes.
  • It works on graphs with non-negative weights.
  • It uses a priority queue to explore the next most promising node.
  • It ensures that once a node's shortest path is found, it is not updated again.

.....

.....

.....

Like the course? Get enrolled and start learning!

Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible