Skip to main content

Kruskal's Algorithm Steps in Short

By
Kruskal's Algorithm Steps in Short  to find out Minimum Spanning Tree
1. Sort the Edges in The Non-Decreasing Order.
2. Create as many Disjoint Set as many Vertices intially.
3. Pick one edge at a time in non-decreasing order & check both the ends of this edge if they are in the same disjoint set or different, if they are in the different disjoint set , merge them together and save the edge,
else ignore that edge.

Comments

Post a Comment

Popular posts from this blog

BitWise Operators Explained in Short

By
Bitwise Operators :    Bitwise Operators do not operate on decimal value of the Number. They first convert the numbers into binary value & then they operate on it. Bitwise opeartors are not used with floating type variables. Bitwise AND :-   & Bitwise OR    :-   | Bitwise XOR :-   ^ Bitwise NOT :-   ~ LEFT SHIFT :- << RIGHT SHIFT :- >> Bitwise AND  & Example : N1 = 10 , N2 = 15 N1 & N2 In Binary  :                                                  0 0 1 0 1 0                                                   0 0 1 1 1 1  ...
Post a Comment
Read more

Insertion Sort in C

By
#include<stdio.h> int main() {     int arr[]={8,5,7,4,3,0};     int n = sizeof(arr)/sizeof(int);     int key=0,i=0,j=0;     for(i=1;i<n;i++){         key=arr[i];         j=i-1;         while(j>=0 && arr[j]>key){             arr[j+1]=arr[j];             j--;         }         arr[j+1]=key;     }      for(i=0;i<n;i++){         printf("%d\t",arr[i]);     }     printf("\n");     return 0; }
Post a Comment
Read more

Activity Selection Problem in Short

By
Activity Selection Problem is used extensively. Suppose a person is given n activities with their start & finish time. Select the maximum number of activities that can be performed by a single person, assuming that a person can only work on a single activity at a time. Greedy Approach:  set n equal to the max finish time  initialize set of selected activity with a 1    set k=1 loop m=2 to n    if start time of current activity is greater than the finish time of last activity            add the current activity to selected activity           set k=m
Post a Comment
Read more