Skip to content
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.

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

Added Minimum Spanning Trees Algorithm #409

Open
wants to merge 1 commit into
base: master
Choose a base branch
from

Conversation

rajatkhanna1999
Copy link

@rajatkhanna1999 rajatkhanna1999 commented Dec 26, 2018

IMPORTANT: Please do not create a Pull Request without creating an issue first.

Any change needs to be discussed before proceeding.

Description

Added folder name Minimum Spanning trees

For Example:

  • Added a file(s) 'kruskal.cpp' and 'prims.cpp' that implements MST.

Related Issue

Kruskals Algorithm for minimum spanning Trees(c++)
Issue #408
This project only accepts pull requests related to open issues.
Please link to the issue here:

Types of changes

What types of changes does your code introduce? Put an x in all the boxes that apply:

  • Bug fix (change which fixes an issue with the algorithm)

  • [ x] New Algorithm (non-breaking change which adds functionality)

  • Documentation

Checklist:

Go over all the following points, and put an x in all the boxes that apply.

If you're unsure about any of these, don't hesitate to ask. We're here to help!

  • My code follows the code style of this project.

  • My change requires a change to the documentation.

  • I have updated the documentation accordingly.

  • I have read the CONTRIBUTING document.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant