Skip to content

Added Prim’s minimum spanning tree algorithm #8 #22

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
Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Added Prim’s minimum spanning tree algorithm #8 #22

wants to merge 1 commit into from

Conversation

anirbandey303
Copy link

@anirbandey303 anirbandey303 commented Sep 30, 2020 •
edited
Loading

Added Prim’s minimum spanning tree algorithm for issue #13

@anirbandey303
Added Prim’s minimum spanning tree algorithm bhavinjawade#8
4611dcb 
Added Prim’s minimum spanning tree algorithm for issue bhavinjawade#8
@bhavinjawade
Copy link
Owner

bhavinjawade commented Sep 30, 2020 •
edited
Loading

Hi @anirbandey303,

Thanks for your contribution. I can not accept your PR because of 2 reasons:

  1. Plagiarism: Please do not copy codes from AlgoTree or any other website. Please try writing them from scratch.
  2. Please write the explanation for Prim's algorithm and add that to a markdown.

Let me know if you have any questions.

Thanks.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@anirbandey303 @bhavinjawade