★ Must-know
📌 A tentative label is an unconfirmed distance estimate, whereas a permanent label is a confirmed shortest distance.
Further detail
Tentative labels are unconfirmed; permanent labels are confirmed shortest distances.
1. A delivery route between two network vertices is considered a shortest path when what condition is met?
2. What does Dijkstra’s algorithm determine when run from a chosen source vertex?
3. During a Dijkstra run, vertex P has a tentative label of 8, while vertex Q has just been selected and its label confirmed as 6. How should these labels be interpreted?
What is a shortest path between vertices?
A route with minimal total edge weight.
What does Dijkstra’s algorithm find from one source vertex?
Shortest paths to all destination vertices.
What does a tentative label represent?
An unconfirmed distance estimate.
What does a permanent label represent?
A confirmed shortest distance.
How does Dijkstra's algorithm initialize vertex distances?
The source gets distance 0; every other vertex gets infinity.
How does Dijkstra's algorithm choose its next working vertex?
It selects the vertex with the smallest tentative label.
It covers the core concepts of Dijkstra and Flooding Algorithms, organized by topic with the key definitions, explanations and takeaways, so it's easier to learn and remember.
Read the full study guide →The practice quiz has 9 multiple-choice questions, each with an explanation. Use it to check what you know and find your gaps.
Take the quiz (9 questions) →There are 27 flashcards on Dijkstra and Flooding Algorithms, with a question on the front and the answer on the back. Try to recall each answer before you flip, and let spaced repetition bring back the ones you miss.
See all 27 flashcards →Upload a PDF or paste your notes. Revizly writes a study guide, a practice quiz and flashcards in about a minute.