Question 15 Consider the following network: b 4 5 2 10 1 3 2 g 8 d 4 6 1 f What is the minimum cost of the path to go from node b to node f: ? a. 6 ? b. 5 ? c. 10 ? d. 9
Added by Domingo C.
Close
Step 1
Starting from node b, we have two options to choose from: either go to node c or node d. If we choose to go to node c, the cost would be 4. From node c, we have two options again: either go to node e or node f. If we choose to go to node e, the cost would be 3. Show more…
Show all steps
Your feedback will help us improve your experience
Kevin Corkran-Itagaki and 58 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Madhur L.
(a) Why does the greedy algorithm work for the spanning tree problem? (b) Show by example that the greedy algorithm could fail to find the shortest path from $s$ to $t$, by starting with the shortest edge.
Linear Programming And Game Theory
Network Models
3. (a) How many paths are there from the point (0, 0) to the point (110, 111) in the plane such that each step either consists of going one unit up or one unit to the right? (b) How many paths are there from (0, 0) to (210, 211), where each step consists of going one unit up or one unit to the right, and the path has to go through (110, 111)?
Lucas F.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD