matrix represents the distance in metres between each of the six security cameras at Soccer City. A B C D E F A 60 100 110 80 70 B 60 70 80 90 85 C 100 70 50 65 105 D 110 80 50 60 40 E 80 90 65 60 40 F 70 85 105 40 40 4.1 A security guard needs to inspect each of the six cameras within his Using Kruskal’s Algorithm find a lower bound for his initially leaving out vertex A. Clearly state the order in which you choose edges. Also state the length of this lower bound. (8) 4.2 The Hamiltonian Circuit A-B-C-D-E-F-A yields a route of 350 metres. By inspection determine a shorter route for the guard to inspect each camera, starting and ending at camera A. (6) [14] QUESTION 5 The network below shows some paths on an estate. The weight of each edge represents the time in minutes, to walk along a path.
matrix represents the distance in metres between each of the six security cameras at Soccer City. A B C D E F A 60 100 110 80 70 B 60 70 80 90 85 C 100 70 50 65 105 D 110 80 50 60 40 E 80 90 65 60 40 F 70 85 105 40 40 4.1 A security guard needs to inspect each of the six cameras within his Using Kruskal’s Algorithm find a lower bound for his initially leaving out vertex A. Clearly state the order in which you choose edges. Also state the length of this lower bound. (8) 4.2 The Hamiltonian Circuit A-B-C-D-E-F-A yields a route of 350 metres. By inspection determine a shorter route for the guard to inspect each camera, starting and ending at camera A. (6) [14] QUESTION 5 The network below shows some paths on an estate. The weight of each edge represents the time in minutes, to walk along a path.