Dijkstra's Shortest Path

Description

The steps for performing Dijkstra's shortest path algorithm
Josh Calvert
Flashcards by Josh Calvert, updated more than 1 year ago
Josh Calvert
Created by Josh Calvert almost 8 years ago
37
6

Resource summary

Question Answer
Step 1 Pick your start point
Step 2 Test the length of every unchecked edge and store the distance at the corresponding node
Step 3 Mark the current node as complete
Step 4 Move to the closest node and set the shortest distance there as its final distance with the node that distance is coming from
Step 5 If this is not the final node, return to step 2. Otherwise, starting at your destination, follow the shortest distances back to the start for your shortest path
Show full summary Hide full summary

Similar

A level Computing Quiz
Zacchaeus Snape
Types and Components of Computer Systems
Jess Peason
Input Devices
Jess Peason
Output Devices
Jess Peason
Computing
Kwame Oteng-Adusei
Pack of playing cards answer
Karl Taylor
Code Challenge Flow Chart
Charlotte Hilton
Data Structures & Algorithms
Reuben Caruana
Algorithms ♡
lauren ♥
Computational Thinking ♡
lauren ♥
Algorithms
George Bettley