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.

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

Newbie to Github and Open Source Nishchay Gupta just created his first repo #108

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

Newbie to Github and Open Source Nishchay Gupta just created his first repo #108

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
32 changes: 32 additions & 0 deletions nik_prims_algo.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
## Thanks for contributing
Please fill the below information <br/>
* Name of the algorithm: Prim's Algorithm
* Data structures used : Graphs

### PRIM'S ALGORITHM

I found Prim's Algorithm to be most intriguing because it was the first algorithm which was taught to me in DSA.

It is used to find Maximum Spanning Tree and the shortest distance from the starting vertex.

It uses Priority Queues to find MST.

In it, starting vertex is given to us to find MST.

Lastly, it has only one subtree and in iteration, a vertex and an edge is added to it.



Time complexity: O((V+E)(log V))

V:Vertex of Graph
E:Edge of Graph

Data Structure used: Graphs





- Nishchay Gupta