Using Dijkstra's algorithm and Kruskal's algorithm to find the maximal band width route between two vertices in an undirected graph. Including a heap implementation and a random graph generation procedure which can generate graphs with exactly the same degree for all vertices