4 2 5 5 8 3 2.5 2 2.5 2 6 6 1 3 6 7 2 3 6 3 4 7 Find the shortest(min cost) path From Node 1 to Node 7. Possible answer is 16. Try to solve it the same way we did problem 1 and 2.
Added by Mohamed M.
Close
Step 1
Step 1: The shortest path from Node 1 to Node 7 is 1 -> 3 -> 2 -> 5 -> 7. Show more…
Show all steps
Your feedback will help us improve your experience
Shaiju T and 99 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
Find the shortest route from node 1 to node 7 in the network shown. If the constant is "1" it must be entered in the box. If your answer is zero enter "0". For negative values enter "minus" sign (-). Min x12 + x13 + x14 + x23 + x25 + x32 + x35 + x46 + x52 + x53 + x56 + x57 + x65 + x67 s.t. Flow Out Flow In Node 1 x12 + x13 + x14 = Node 2 x23 + x25 + x12 + x32 + x52 = Node 3 x32 + x35 + x13 + x23 + x53 = Node 4 x46 + x14 = Node 5 x52 + x53 + x56 + x57 + x25 + x35 + x65 = Node 6 x65 + x67 + x46 + x56 = Node 7 + x57 + x67 = xij ≥ 0 for all i and j Optimal Solution: Variable Value x12 x13 x14 x23 x25 x32 x35 x46 x52 x53 x56 x57 x65 x67 Shortest Route: 1-2-5-6-7 Length =
Shaiju T.
Kirsty G.
The following table represents a network with the arcs identified by their starting and ending nodes a) Use the minimal spanning tree method to find the minimum distance required to connect these nodes. b) List the sequence of these connected nodes.
C D.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD