0
Q
Who’s algorithms do we use for shortest paths
A
Dijkstra’s
1
Q
What does the shortest path mean
A
Finding the shortest route from a to b
2
Q
What does dijkstras algorithm initial
A
The algorithm intails that whee have to make the vertexes permanent by putting. Box around them and to put a box around them you have to travel down different routes to find the shortest one
3
Q
Once you have made all if the vertex perminet then what do you need to do
A
Work from the back to find the route
4
Q
Some some networks are directed so what does this mean
A
You are only allowed to travel down them one way not the other
5
Q
What is. Limitation of dijkstras algorithm
A
It doesn’t take into account negative numbers
Decision Maths
flashcards
Decks in class (3)
# Cards
