Ex 13D - (with a little of 13C) Weighted Graphs and Networks

What is the shortest path between C and E?

• C − A − E

• C − D − A − E

• C − D − G − E

• C − G − E

• C − G − H − E

What is the shortest path from S to D in this graph?

• S-A-D

• S-A-C-D

• S-B-F-D

By inspection the length of the shortest path from A to F is?

• A-B-D-F

• A-B-D-E-F

• A-C-D-E-F

• A-C-D-F

If this graph represents towns connected by roads. Which two towns are 11 minutes apart by road?

• A-C

• C-D

• B-E

• D-E

This graph represents 5 towns on a map. The weights represent the average time it takes to travel between towns. How long would it take to travel between Stratmoore and Croghon if you needed to travel via Bartow?

• 19

• 14

• 20

• 15

This graph represents towns on a map and the weight is the distance between the towns. A motorist intends to drive from D to A via C. How much time will they save if they travel directly from D to A.

• 15

• 10

• 5

• 20

Which one of the following is NOT a Hamiltonian Cycle for this graph?

• ABCFEDA

• BADEFCB

• CDEFABC

• DEFACBD

• EFCBADE

Which of the following is a Eulerian Circuit?

• 
• 
• 
• 
• 

Graphs that have a number associated with each edge are called

• Newworks

• Matrices

• Column Graphs

• Weighted Graphs

Draw a graphs representing a CYCLE through vertices A, B C and D