This session we worked on networks, looking at Minimum Spanning Trees, for graphs using Prim's and Kruskal's algorithm to solve them as well as finding the shortest paths. Harry did pretty well with these questions so next session we will do some harder ones and then move onto a new topic.