Skip to content

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

Open
whois-pk wants to merge 6 commits into
meshtag:testingfrom
whois-pk:feat/mst
Open

[feat] Prim-Jarnik's algorithm for Minimum Spanning Tree#33
whois-pk wants to merge 6 commits into
meshtag:testingfrom
whois-pk:feat/mst

Conversation

@whois-pk

Copy link
Copy Markdown
Contributor
  • 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 <2182001pk@gmail.com>
Signed-off-by: Pankaj Khushalani <2182001pk@gmail.com>
@whois-pkwhois-pk changed the title feat(mst): initial implementation[feat] Prim-Jarnik's algorithm for Minimum Spanning TreeMay 25, 2023
Signed-off-by: Pankaj Khushalani <2182001pk@gmail.com>
@whois-pk

Copy link
Copy Markdown
ContributorAuthor

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 <2182001pk@gmail.com>
Signed-off-by: Pankaj Khushalani <2182001pk@gmail.com>
@whois-pk
whois-pk marked this pull request as ready for review May 28, 2023 10:52
@meshtag

Copy link
Copy Markdown
Owner

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

Comment threadbenchmarks/BoostMinSpanningTree.cpp Outdated
Signed-off-by: Pankaj Khushalani <2182001pk@gmail.com>
Sign up for freeto 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

@whois-pk@meshtag