Dijkstra's, a Euler Tour and a Minimal spanning tree (a.k.a) Kruskal's or Prim's algorithm.
After a bit of research are these the 3 things I need for the 3 questions?
Have to do this question fairly soon in an exam. This is pretty much the exact same question that will be on it.
What sort of maths is this and how the hell do I do it??!? I don't have any notes on it.
-----------
The following network (Figure 1 below) represents the road system in the town...