Features of Networks/Graphs

The first step in solving a maximum flow problem is to...

• Highlight the source and the sink.
• Perform a column reduction
• Perform a row reduction
• Choose any node

The first step in solving a Hungarian Algorithm problem is to...

• Highlight the source and the sink.
• Perform a column reduction
• Perform a row reduction
• Choose any node

The first step in solving a minimum spanning tree problem is to...

• Highlight the source and the sink.
• Perform a column reduction
• Perform a row reduction
• Choose any node

Prim's Algorithm can be used...

• On a network
• On a table
• One neither a table nor a network
• On either a table or a network

The maximum flow through the middle pathway is...

• 6
• 7
• 9
• 22

The minimum completion time for this project network is...

• 12
• 10
• 11
• 13

The critical path for this project network is...

• AEFH
• AB
• ACG
• AEDG

The source is...

• A
• D
• F
• B

The maximum flow along ABEF is...

• 14
• 70
• 54
• 138

Which arc determines the maximum flow along ADHF

• HF
• AD
• DH
• DK