1
Q
Dijkstra’s Algorithm
A
- used to find shortest path between two nodes in a graph
- similar to breadth-first search but keeps track of visited nodes with priority queue
2
Q
Application of Dijkstra’s Algorithm
A
- satellite navigation systems
- routers (shortest path when routing packets within network)
Practical cs
flashcards
Decks in class (26)
# Cards
-
Computer science paper 118
-
CS Paper 116
-
CS paper 1..21
-
cs paper 115
-
cs paper 119
-
cs paper 1...12
-
cs paper 1 - past paper questions25
-
paper 3 econ33
-
cs 1.132
-
cs 1.2.3
-
cs 4.1.13
-
cs 4.2.3
-
CS 1.1. (ALEVEL)3
-
cs 1.2 (OOP) (ALEVEL)12
-
CS 2.1 -definitions (ALEVEL)28
-
cs 2.1 data structures (ALEVEL)14
-
CS 3.1. (ALEVEL) - Graph Traversal2
-
CS 3.2. (ALEVEL) Tree-Traversal3
-
CS 3.3. (ALEVEL) - Reverse polish2
-
CS 3.4. (ALEVEL) -Searching algorithms3
-
CS 3.5. (ALEVEL) - Sorting Algorithms2
-
CS 3.6. (ALEVEL) - Optimisation Algorithm2
-
CS 4.2. (ALEVEL) - Regular Languages11
-
CS 4.3. (ALEVEL) - Context-Free Languages5
-
CS 4.4. (ALEVEL) - Classification of Algorithms4
-
CS 4.5. (ALEVEL) - Model of Computation2
