Task 2:

Comment

(2a)

[20%]

The weighted graph above has 5 nodes and 7 edges. Create a weighted graph of 15 nodes and

35 edges. Run Kruskal's algorithm manually to get a minimum spanning tree of the graph as

done in Task 1a.

(2b)

[20 %]

Run the Python code to the same graph of 15 nodes and 35 edges. Compare the output of the

code and the manually generated result above to see whether they are equivalent as done in

Task 1b./nComment

Deliverables:

Deliverable 1- the report in PDF format

Use a template file provided to write a report; the file name should include your ID. It should

be saved or exported as a pdf format and uploaded as the main document.

Deliverable 2-well-commented python source code

The correctly working source code should be uploaded as a zip file. This should be self-

contained such that no additional download should be required to run it.

Failure of submitting the source code may lower your total mark by up to 50 marks.

Deliverable 2 should be placed in a zip file which must be uploaded separately from the

report.