-
Notifications
You must be signed in to change notification settings - Fork 18
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
feat: Branch mst final #82
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
some minor edits, otherwise, good to merge
Prim's Algorithm uses a priority queue to keep track of the minimum weight edge that connects the current tree to an | ||
unexplored node, which could possibly be updated each time a node is popped from the queue. | ||
|
||
Kruskal's Algorithm uses a priority queue to sort all the edges by weight and the elements will not be updated at any |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
doesnt use a PQ right?
@@ -0,0 +1,45 @@ | |||
# Minimum Spanning Tree Algorithms | |||
|
|||
## Background |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
could you briefly discuss the 4 properties of MST?
- Cut a MST and you'll get 2 MSTs
- no cycle (this and (1) is saying the same thing)
- cycle property
- cut property (also tells you that the minimum outgoing edge of every vertex is part of mst)
..
|
||
### Implementation Details | ||
|
||
A priority queue (binary heap) is utilised to keep track of the minimum weight edge that connects the current tree to an |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
nice, but could you break it down into steps? so the chunk of text doesnt look too intimidating
No description provided.