This is an entirely java program. In this project you will be using Kruskal`s Algorithm, Prim`s Algorithm, Graph theory, Adjacency list and Binary search to create a program that write the minimum length of a given bridges to connect to different islands.
Please be very familiar with Kruskal`s Algorithm and Prim`s Algorithm,
I have examples of working programs that are similar to this that I will provide. I will explain more in details later and will provide all the information about this project. I have some helper methods and classes already written for this program as well that you will use. The program is more of a technical program it is not a long program at all in terms of lines of code. You will not be writing more than 40 lines of code. If you are efficient it will be a lot less than that.