★ Must-know
📌 A tentative label is not confirmed, whereas a permanent label represents a confirmed shortest distance.
📐 Formula - Relaxation updates the distance to v using .
Further detail
In Dijkstra's algorithm, the working node is considered with its adjacent nodes when updating distances.
A shortest path can be reconstructed using predecessor or probe nodes.
1. In a weighted graph, what makes one path between two nodes a shortest path?
2. A simple path is sought between two nodes in a graph with vertices. What is the greatest number of edges it can contain?
3. What problem does Dijkstra's algorithm solve when run from a chosen source node?
What defines a shortest path between nodes?
It has the minimum total edge weight.
What does Dijkstra's algorithm find from one source?
Shortest paths to all destinations.
What initial distances does Dijkstra's algorithm assign to the source and other nodes?
Zero for the source and infinity for every other node.
What is a vertex in a graph?
A node in a graph.
How does flooding forward an incoming packet?
On every outgoing line except the line on which it arrived.
How does Dijkstra routing differ from flooding in packet forwarding?
Dijkstra selects shortest routes; flooding forwards through all eligible outgoing lines.
It covers the core concepts of Shortest Paths and Flooding, 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 8 multiple-choice questions, each with an explanation. Use it to check what you know and find your gaps.
Take the quiz (8 questions) →There are 8 flashcards on Shortest Paths and Flooding, 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 8 flashcards →Upload a PDF or paste your notes. Revizly writes a study guide, a practice quiz and flashcards in about a minute.