Finite Mathematics Quiz
7 questions · no time limit
0:00
LOGIC, SETS, AND NETWORKS
Question 1 of 7
No time limit
Current
Answered
Flagged
Not seen
A network has 6 vertices connected in a specific topology. When finding shortest paths from vertex 1 to all other vertices using breadth-first search (assuming unit edge weights), the algorithm processes vertices in this order: 1, 2, 3, 4, 5, 6. The shortest path distances found are: to vertex 2 (distance 1), to vertex 3 (distance 1), to vertex 4 (distance 2), to vertex 5 (distance 2), to vertex 6 (distance 3). Which property must be true about the network topology?
YOUR PROGRESS
7
QUESTIONS
Ready when you are
Answer in any order. Your progress shows here as you go.
QUESTIONS
KEYBOARD
Pick an answer ABCD
Next question ↵→
Previous ←
Flag for review F
Answers save as you go · flagged questions come back at the end