1
Q
What does Dijkstra algorithm find
A
The shortest path between two nodes
2
Q
How can Dijkstra’s algorithm be used
A
Finding shortest routes between cities
Finding cheapest flight routes
Planning circuit boards
Computer Science: Paper 1
flashcards
Decks in class (23)
# Cards
-
Programming (Python)27
-
List methods (Python)9
-
File Object methods (Python)7
-
OOP (Python)11
-
Stacks9
-
Call Stack (Heap)7
-
Queues15
-
Hash tables9
-
Dictionaries2
-
Graphs9
-
Trees7
-
Vectors3
-
Graph traversal algorithm6
-
Searching algorithms2
-
Optimisation algorithms2
-
Sorting algorithms3
-
Reverse Polish Notation4
-
Big O notation8
-
Finite State machines8
-
Turing machine8
-
Maths for Regular expression (Regex)13
-
Regular expression (Regex)7
-
Backaus-Naur Form9
