Skip to main content

Krusal's Algorithm Implementation in Java with full source code

Image
By

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
Labels:

Comments

Post a Comment

Popular posts from this blog

The Zoo Management System - entity relationship diagram & MS Access Database

By
Zoo Management System - Project Details: You are the employee of a big, worldwide working Zoo Management Company. Your company is responsible for the Zoo management. Your boss thinks it would be a great idea to store all data for each Zoo in a brand new self-developed ZOO Management System. Up to now, the ZOO management company has maps of each ZOO available. Your boss knows that you took a course in introduction on an ERP system, so he asks you if you could help designing such a system. Each ZOO must have the same organizational structure, which should look like this: Each Zoo has a Zoo-Address. Each Zoo has many visitors (Visitor Ticket Process (VTP). Many Zoo-Attractions belong to a Zoo. Module 1: Entity Relationship Diagram Design a ER (entity-relationship) diagram for your ZOO Management System. Use the information provided below with the entities and its attributes. Put the entities in the correct relationship to each other (organizational structure). Module 2: DB Implem...
1 comment
Read more

Human Physiology by Stuart Ira Fox [PDF] (12th edition) free download

By
21 comments
Read more

Student Registration System Web Project using HTML, CSS & PHP

By
Student Registry System In this task, you’re to further develop the student registry you started on lab-task. The solution is based the on the use of HTML5, stylesheets, and PHP, and will use a database for storage of information, MySQL on (school website) is used for this. Information of students is saved in the table student, ID is primary key and is set In addition to this, you need a table named class where id a is the primary key and is set up with AUTOINCREMENT, other columns and data types in accordance with the figure. The property class in the student table needs to be a foreign key that refers to the ID column in the class table. In MySQL you need to use tables of the type INNODB with support for foreign keys, reference integrity shall remain. The task: Write a class with the name StudentRegister (means Student registry), the class should use PDO and only prepared statements/questions. The class shall implement the interface StudentInterface, and use the two classes, Student,...
Post a Comment
Read more