Find Maximum Bandwidth Path in a given graph.
Use Graph class to create random graph of given number of vertices and density.
Implementation of MaxHeap data structure.
Implementations of maximum bandwidth path calculation using Dijkstra's and Kruskal's algorithm.
Test all maximum bandwidth algorithms with sparse and dense graphs.