[go: up one dir, main page]
Scribd
Upload
246 views4 pages

Dijkstra's Algorithm

Dijkstra's algorithm finds the shortest paths between nodes in a graph and was invented by computer scientist Edsger Dijkstra in 1956 while having coffee in a Paris cafe. It works by finding the shortest path from one starting node to a target node or all other nodes in the graph but has limitations in that it may not find the true shortest path if there are negative edge weights and can be inefficient for large graphs as it explores all paths not just those heading towards the target.

Uploaded by

Adnan Saleem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
246 views4 pages

Dijkstra's Algorithm

Dijkstra's algorithm finds the shortest paths between nodes in a graph and was invented by computer scientist Edsger Dijkstra in 1956 while having coffee in a Paris cafe. It works by finding the shortest path from one starting node to a target node or all other nodes in the graph but has limitations in that it may not find the true shortest path if there are negative edge weights and can be inefficient for large graphs as it explores all paths not just those heading towards the target.

Uploaded by

Adnan Saleem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Dijkstra's Algorithm

Shortest path finder


Dijkstra's Algorithm Start

Invented by Computer Scientist Edsger Dijkstra


in 1956 on the back of a napkin while sat having
a coffee in a Paris Cafe.

?
Designed to find the shortest path from one
node on a graph to a target node on a graph(or
all other nodes on a graph).

End
Dijkstra's Algorithm Example
Limitations of Dijkstra's Algorithm

Doesn't always find the shortest path when there are negative costs (edge
weights) between nodes.

It can be extremely inefficient when searching larger graphs as it explores the


shortest current path, regardless of whether that path is heading towards the
target.

You might also like