Shortest network path
Edges: A-B=4, A-C=2, C-B=1, B-D=5, C-D=8. Candidate A-C-B-D costs 2+1+5.
- Compare complete path costs.
- Apply the method to this new case and check the strongest alternative.
123
02
PRACTICE MISSIONcounting, recursion, graphs, algorithms, and connectivity
counting, recursion, graphs, algorithms, and connectivity
What is the shortest listed route from A to D?
MODELNetwork Logic Board
MATH
PROVEChoose with evidence
CLUE
Pause. Find what matters. Then make your move.