New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Kruskals Algo for Graph #179

Open

vedant-jain03 opened this issue Oct 1, 2021 · 1 comment

vedant-jain03 commented Oct 1, 2021 •

edited

Loading

MST is a tree which has no cycle and minimum wieghted edge

Algo to implement MST:

Sort according to wieght;
Using DSU try to find that respective edge form a cycle or not if not add the edge.

vedant-jain03 changed the title ~~Bellman Ford Algo for Graph~~ Kruskals Algo for Graph

ghost commented Oct 2, 2021

Hello... I have added Kruskal's algorithm in java and created a pull request. Please do consider my pull request.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment