Chapter 9 Network Models

Chapter 9 – Network Models

Selected Exercises: Storm Output only

bubba - problem 9.3

Shortest Paths from NODE 1

Destination Distance Path

NODE 2 20.0000 NODE 2

NODE 3 16.0000 NODE 3

NODE 4 32.0000 NODE 2--NODE 4

NODE 5 31.0000 NODE 3--NODE 5

NODE 6 36.0000 NODE 3--NODE 5--NODE 6

NODE 7 43.0000 NODE 2--NODE 4--NODE 7

bubba - problem 9.4

Shortest Paths from NODE 1

Destination Distance Path

NODE 2 3.0000 NODE 2

NODE 3 4.0000 NODE 3

NODE 4 3.0000 NODE 4

NODE 5 6.0000 NODE 4--NODE 5

NODE 6 8.0000 NODE 4--NODE 5--NODE 6

NODE 7 11.0000 NODE 4--NODE 5--NODE 6--NODE 7

NODE 8 10.0000 NODE 4--NODE 5--NODE 6--NODE 8

bubba - problem 9.5

Shortest Paths from NODE 1

Destination Distance Path

NODE 2 1.0000 NODE 2

NODE 3 5.0000 NODE 3

NODE 4 2.0000 NODE 4

NODE 5 11.0000 NODE 3--NODE 5

NODE 6 13.0000 NODE 2--NODE 6

NODE 7 9.0000 NODE 3--NODE 7

NODE 8 14.0000 NODE 3--NODE 5--NODE 8

NODE 9 18.0000 NODE 2--NODE 6--NODE 9

NODE 10 19.0000 NODE 3--NODE 5--NODE 8--NODE 10

bubba - problem 9.6

Shortest Paths from CHICAGO

Destination Distance Path

NODE 1 35.0000 NODE 1

NODE 2 20.0000 NODE 2

NODE 3 20.0000 NODE 3

NODE 4 30.0000 NODE 4

NODE 5 55.0000 NODE 3--NODE 5

NODE 6 50.0000 NODE 3--NODE 6

NODE 7 100.0000 NODE 3--NODE 8--NODE 7

NODE 8 80.0000 NODE 3--NODE 8

NODE 9 85.0000 NODE 4--NODE 10--NODE 9

NODE 10 70.0000 NODE 4--NODE 10

bubba - problem 9.12

Minimal Spanning Tree

------Arc ------

From Node To Node Arc Length

NODE 1 NODE 2 6.0000

NODE 2 NODE 5 5.0000

NODE 5 NODE 6 3.0000

NODE 6 NODE 8 2.0000

NODE 6 NODE 3 4.0000

NODE 8 NODE 7 4.0000

NODE 3 NODE 4 5.0000

Length of Minimal Spanning Tree = 29.0000

bubba - problem 9.14

Minimal Spanning Tree

------Arc ------

From Node To Node Arc Length

NODE 1 NODE 4 2.0000

NODE 4 NODE 3 2.0000

NODE 3 NODE 2 2.0000

NODE 4 NODE 5 3.0000

NODE 4 NODE 6 3.0000

NODE 6 NODE 7 2.0000

NODE 7 NODE 8 3.0000

NODE 8 NODE 9 3.0000

NODE 9 NODE 11 4.0000

NODE 11 NODE 10 4.0000

Length of Minimal Spanning Tree = 28.0000