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.
What routing approach and knowledge does flooding use?
Static routing and local knowledge.
Which flooding revision cues describe its forwarding, hop limit, duplicate detection, and selective directions?
Flooding uses all eligible outgoing lines; a hop counter limits hops, a sequence number detects duplicates, and selective flooding uses selected directions.
Answer 8 questions on Shortest Paths and Flooding.
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?
Go over the full study guide for Shortest Paths and Flooding.
Read the study guide →Upload your class notes and Revizly writes your flashcards in about a minute.
Flashcard maker