Shortest Paths and Flooding Flashcards (8 cards)

All cards

1Question

What defines a shortest path between nodes?

Answer

It has the minimum total edge weight.

2Question

What does Dijkstra's algorithm find from one source?

Answer

Shortest paths to all destinations.

3Question

What initial distances does Dijkstra's algorithm assign to the source and other nodes?

Answer

Zero for the source and infinity for every other node.

4Question

What is a vertex in a graph?

Answer

A node in a graph.

5Question

How does flooding forward an incoming packet?

Answer

On every outgoing line except the line on which it arrived.

6Question

How does Dijkstra routing differ from flooding in packet forwarding?

Answer

Dijkstra selects shortest routes; flooding forwards through all eligible outgoing lines.

7Question

What routing approach and knowledge does flooding use?

Answer

Static routing and local knowledge.

8Question

Which flooding revision cues describe its forwarding, hop limit, duplicate detection, and selective directions?

Answer

Flooding uses all eligible outgoing lines; a hop counter limits hops, a sequence number detects duplicates, and selective flooding uses selected directions.

Test yourself with the quiz

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 nn vertices. What is the greatest number of edges it can contain?

Take the quiz →

Read the study guide

Go over the full study guide for Shortest Paths and Flooding.

Read the study guide →

Related classes

Make your own flashcards

Upload your class notes and Revizly writes your flashcards in about a minute.

Flashcard maker