Omputer Science / ICT Mathematics for Software

1.
a. Sketch 5 different graphs, two simple, two weighted, and one weighted digraph
(directional graph). Label both the vertices and edges. (7.5 marks)
b. For each of these graphs produce a vertex list V[], and edge list E[], and an
adjacency list A[]. (7.5 marks)
2. For all the graphs in you created in question 1, produce the labelled adjacency
matrix and incidence matrix. (15 marks)
3. For the two weighted graphs, use Primas algorithm to find the minimum spanning
tree for each one. Show all workings. (15 marks)
4. For the two weighted graphs, use Kruskalas algorithm to find the minimum
spanning tree for both. Show all workings. (15 marks