Networks Test Prep

A town’s water supply flows from a dam through a network of underground pipes to individual houses.

The network diagram of the pipes shows the amount of water, in kilolitres, that can flow through the pipes to individual houses at any given time.

Determine the maximum flow from the water supply to house G.

The network diagram shows the distance between suburbs in kilometres.

Calculate the minimum distance that connects all suburbs (weight of the minimum spanning tree).

The diagram represents a network with weighted edges.

What is the total length of the minimum spanning tree?

• 17

• 20

• 24

• 27

Consider the network diagram.

How many edges does the network have?

• 5

• 6

• 7

• 8

What is the sum of the degrees of the network shown?

• 5

• 6

• 11

• 12

What is the sum o the degrees of the network shown?

• 11

• 14

• 16

• 26

What is the maximum flow from the source to the sink?

• 11

• 14

• 16

• 26

The table below shows the distances, in kilometres, between a number of towns.

Using the vertices given, draw a weighted diagram to represent the information shown in the table.

The table below represents a network.

Complete the network diagram below to accurately reflect the information in the above table.

The network shows the distances, in kilometres, along roads that connect the cities of Austin and Boyle.

The shortest distance, in kilometres, from Austin to Boyle is

• 7

• 8

• 9

• 10