Module 5 Extended Response/Problem Networks & directed graphs

Part 1

a) E has a degree of 4. (1 mark)

b) You can go directly from E to any of 4 departments, here C, D, F or G.
(2 marks)

c) None of the edges meet at any point except vertices. (1 mark)

d) V = 7, E = 13, R = 8
Eulers Rule is V + R = E + 2
7 + 8 = 13 + 2
15 = 15
so Eulers rule is true because both sides are equal to 15. (2 marks)

e) ABDGBA or ABGDBA or any other suitable circuit (2 marks)

f) He wants to use an Eulerian Circuit. (2 marks)

g) An Eulerian circuit requires that the degree of all vertices is even. Here A, B, C,
F and G all have odd degrees so it would be impossible to follow an Eulerian
circuit. (3 marks)

h) No, it is not possible. The path she wants to follow is a Hamiltonian circuit and
she cannot avoid going to B twice as it is the only connection both in and out of
the supermarket at A. (3 marks)

i) ABGECFCDBA, a distance of 268 metres. (3 marks)

j)
(3 marks)

k) 172 metres. (1 mark)

Module 5 Extended Response/Problem Networks & directed graphs
Part 2

a) 14 (number of edges) (2 marks)

b) 4 rounds each (degree of every vertex is 4) (2 marks)

c) (6 7)/2 = 21 (number of edges in a complete graph with 7 vertices)
(2 marks)

d) A (registers/entry/exit) won because they won the most rounds at 3, shown in
the dominance vector (2 marks)
e) Because B, C, E, F and G are all equal on 2 wins. (1 mark)

f) (2 marks)

g) The value in this position is 2. It means that E defeated 2 departments that each
defeated D. In this case E defeated C who defeated D and E defeated F who
defeated D. (3 marks)

h) (2 marks)

Module 5 Extended Response/Problem Networks & directed graphs
i) Because E, F and G are still all equal at 6 as shown in the dominance vector
(2 marks)

j) , with as the
dominance vector is so F will take the second place. (2 marks)

k) A has defeated D 6 different ways. One of these is a two step dominance where
A defeated B who defeated D. Five of these are three step dominances ABCD,
AGFD, AEFD, AGBD and AECD. In each case A defeated another department
who defeated another department that defeated D. (3 marks)

l)





(5 marks)

l) TRUE m) TRUE n) FALSE o) FALSE


p) (3 marks)
Part 3 Network Flow
Module 5 Extended Response/Problem Networks & directed graphs

a) Because it does not cut off the sink from
the source. Flow can still happen
through the middle and bottom of the network.
(2 marks)



b) The capacity is 33. This is calculated
using 8 + 0 + 12 + 13 = 33. The edge
marked 7 is counted as zero in this situation.
(2 marks)


c) The cut has a capacity of 33. This cut tells us that the flow through the network
cannot exceed 33 tonnes. (2 marks)

d) The minimum cut is 24 and so
the maximum flow is 24 tonnes.
(3 marks)


e) This is one possible
allocation. There are others. A
correct answer must have every cut
reduced to 24 and the flow into
every vertex must be the same as
the flow out of that vertex. One
truck (the edge marked 7) does not
need to run at all. (3
marks)

Part 4 Activity Network
Module 5 Extended Response/Problem Networks & directed graphs

a) Complete the table above by adding the predecessors for each activity. (2
marks)
Activity Description Time in
days
Predecessor(s)
A Organising invitations and sending
out
3
B Receiving and collating replies 7 A
C Organising entertainment 6 A
D organising food 3 B
E organising drinks 4 B
F Setting up kitchen 2 D and E
G Setting up entertainment 1 C
H Holding party 1 F and G
I Cleaning up 2 H

b) 14 days (2 marks)

c) ABDFHI, 18 days ABEFHI, 19 days ACGHI, 13 days (3 marks)

d) Critical path is ABEFHI, critical time is 19 days (2 marks)

e) 15 days. (2 marks)

f) 14 days (2 marks)

g) ABDFHI (2 marks)

h) B, E, F and I should all be reduced. (2 marks)

i) B is $0, E is $800, F is $900 and I is $400, so a total of $2100 (1 mark)

j) B, E and I would only cost $1200 to reduce the time to 16 days. (2 marks)

k) C is only on the path ACGHI. This path is never critical because it is only 13
days long. Both paths ABEFHI and ABDFHI are critical at one point, so only
activities on these paths are important to reduce. (2 marks)

Module 5 Extended Response/Problem Networks & directed graphs
Part 4 Hungarian Algorithm

a) (1 mark)

b) (2 marks)

c) It is the matrix showing where the greatest differences exist. Where there are
zeros no difference exists, but larger numbers mean greater differences.
(2 marks)

d)

Andrew should collate, Bronwyn should pack shelves,
Diana should transport and Charles should remove the
rubbish.
(2 marks)

e) 10 hours. (1 mark)