Krusal's Algorithm Implementation in Java with full source code

By Hassnain Jamil -

Krusal's Algorithm Introduction:

In this project you will need to implement Kruskal's algorithm. Watch the videos that I posted for a description of the algorithm. Your code should start by reading a text file that contains the edges and weights of a graph. For example, this graph:


will be described in a text file that looks like:
A,1,B,2,D,2,F
B,1,A,1,C,2,D
C,1,B,1,D,3,E
E,3,C,2,D,1,G
G,1,E,3,D,3,F
F,1,D,3,G,2,A
D,2,A,2,B,1,C,2,E,3,G,1,F

Krusal's Algorithm Implementation:

The second line for example (B,1,A,1,C,2,D) means that the B is connected to A with weight 1; B is connected to C with weight 1, and B is connected to D with weight 2.
Start by creating an Edge class that will have node1 (String), node2 (String), and weight (int) 
Then, read the text file line by line; for each line, loop through the edges and create an Edge object for each edge. Add that edge to an array of Edges
Sort that array according to their weights; you can use Arrays.sort()

Sorting used in Krusal's Algorithm:

After sorting all the edges, you need loop through them (starting at smallest weight) and for each edge check the root of node1 and node2 (using function "findRoot" that you will have to implement); if the two roots are the same, do not print that edge and go to next edge; if the two roots are different, print the edge (C,1,B for example), make changes to the parent array, and add the weight of that edge (1) to a variable that will contain the weight of the entire minimum spanning tree, and go to next edge.

findRoot function in Krusal's Algorithm:

"findRoot" will check the dictionary (or HashMap) of the nodes and their parents (description in the video)
One thing that you would want to keep in mind is that in your array that contains all edges, you don't want to have the same edge twice; you can use an additional HashMap to check whether that edge already exists of not.

CONTACT DETAILS

For any other questions or other tasks please feel free to contact me
via email: mhassnainjamil@gmail.com
via WhatsApp: +92-324-7042178
via skype: hassnainjamil1

Comments

Post a Comment

Popular posts from this blog

[SOLVED] Tape for a Turing Machine using Doubly-linked List in Java with full source code

By Anonymous -
Tape for a Turing Machine (Doubly-linked List) Short exercise in which you will code part of an existing project. In this case, you will be working with a doubly-linked list. To make this topic more interesting, the list that you work on will be part of a Turing Machine. A Turing Machine is a kind of very simple, abstract computing device that was introduced in the 1930's by Alan Turing as a way of studying computation and its limitations. The classes that you need for the lab are in a package named turing. You will define a new class named Tape in this package. You can find the Java source in the code directory. You should copy this directory into an Eclipse project. There will be errors, since the existing classes depend on the Tape class, which you have not yet written. Don't forget the Javadoc comments. A Class for Turing Machine Tapes A Turing machine works on a "tape" that is used for both input and output. The tape is made up of little squares called cell...
Read more

[SOLVED] ICT285 Databases TMA 2017 Assignment 1 | Relational Algebra, Database Design & Implementation

By Anonymous -
Relational Algebra A database records information about athletes competing at the Olympics. An athlete competes for a particular country in one or more events. Events take place at a scheduled day and time in a particular venue. The result (rank) is recorded for all athletes in the final of the event. The medal (gold, silver or bronze) is also recorded for the medal winners in the event. Note that we are not considering team sports or heats in this example – only individuals competing in the finals. The schema for this database is as follows: (Note that primary keys are shown underlined, foreign keys in bold). ATHLETE ( AthleteNo , AthleteName, CountryName) COUNTRY ( CountryName , NumberOfCompetitors) EVENT (EventName, ScheduledStart, VenueName ) VENUE (VenueName, City, Capacity) FINAL ( AthleteNo , EventName , Rank, Medal) Provide relational algebra (NOT SQL) queries to find the following informaList the name and country of all athletes. List the event name and scheduled...
Read more