Skip to content

Conversation

@whois-pk
Copy link
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

whois-pk added 2 commits May 26, 2023 00:38
Signed-off-by: Pankaj Khushalani <2182001pk@gmail.com>
Signed-off-by: Pankaj Khushalani <2182001pk@gmail.com>
@whois-pk whois-pk changed the title feat(mst): initial implementation [feat] Prim-Jarnik's algorithm for Minimum Spanning Tree May 25, 2023
Signed-off-by: Pankaj Khushalani <2182001pk@gmail.com>
@whois-pk
Copy link
Contributor Author

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

whois-pk added 2 commits May 28, 2023 16:20
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
Owner

meshtag commented May 28, 2023

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

Signed-off-by: Pankaj Khushalani <2182001pk@gmail.com>
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