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

[feat] Prim-Jarnik's algorithm for Minimum Spanning Tree #33

Open
wants to merge 6 commits into
base: testing
Choose a base branch
from

Conversation

pk-218
Copy link
Contributor

@pk-218 pk-218 commented May 25, 2023

  • Added Prim-Jarnik's implementation of minimum spanning tree algorithm
  • Output matches boostorg/graph's output as a parent array i.e. parent[1] = 2 indicates parent of vertex 1 in MST is vertex 2 and so on.

Screenshot from 2023-05-26 00-42-47

Signed-off-by: Pankaj Khushalani <[email protected]>
Signed-off-by: Pankaj Khushalani <[email protected]>
@pk-218 pk-218 changed the title feat(mst): initial implementation [feat] Prim-Jarnik's algorithm for Minimum Spanning Tree May 25, 2023
Signed-off-by: Pankaj Khushalani <[email protected]>
@pk-218
Copy link
Contributor Author

pk-218 commented May 28, 2023

Benchmark output for 10 nodes -
Screenshot from 2023-05-28 16-11-08

Number of vertices vs. Log CPU time for benchmark bar graph -
Figure_1

Signed-off-by: Pankaj Khushalani <[email protected]>
Signed-off-by: Pankaj Khushalani <[email protected]>
@pk-218 pk-218 marked this pull request as ready for review May 28, 2023 10:52
@meshtag
Copy link
Owner

meshtag commented May 28, 2023

@amanchhaparia , review this PR. Ping me later once you think everything is as expected.

benchmarks/BoostMinSpanningTree.cpp Outdated Show resolved Hide resolved
Signed-off-by: Pankaj Khushalani <[email protected]>
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.

2 participants