Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959, is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing. An equivalent algorithm was developed by Edward F. Moore in 1957.
Dijkstra's algorithm
topic information
general information about Dijkstra's algorithm
|
Aliases:
0080-15db
|
related topics
topics related to Dijkstra's algorithm
message stream 
messages about Dijkstra's algorithm
exussum
@jerrykuch Fundamentals are important. Gotta keep the skills sharp. Give me 100 fib heaps and 100 Dijkstra's algorithm now!
10 days ago
from
Echofon
signwitch08
OO C++ Engineers - Dijkstra's Algorithm ? Have you used this? If so, contact me.....tomwhite@peoplesource.co.uk
9 ½ days ago
from
Twitter
algoviz
AV of the Day: JHAVÉ - Djikstra's Algorithm ( http://wiki.algoviz.org/AlgovizWiki/Viz/JhaveDjikstra )
8 days ago
from
Drupal
InfoVis CyberInfrastructure- Betweenness Centrality
6 days ago
from
TwitterBar
Why do we use priority queues when implementing Dijkstra's Algorithm?
stackexchange
StackExchange: Why do we use priority queues when implementing Dijkstra's Algorithm? - http://stackexchangesites.com/Iqh
4 days ago
from
WordTwit
Finding all shortest paths from every pair of nodes on a graph
stacktrilogy
Finding all shortest paths from every pair of nodes on a graph http://bit.ly/c9kWCB #graphs #graph #graphtheory #algorithm #shortestpath
3 days ago
from
API
TallGuyRob
And so we're doing Dijkstra's algorithm for map traversal in A.I; Is an evaluative approach an A.I method?
2 ½ days ago
from
Tweetie
Planning Algorithms / Motion Planning
delicious50
Planning Algorithms / Motion Planning http://bit.ly/aiqQWn books programming algorithm math
11 hours ago
from
Recent Delicious
