Adding algorithms for minimum spanning tree

[czgdp1807]

Description of the problem

The following algorithms(both serial and parallel version) are to be added through a series of PRs.

1. Prim's Algorithm - https://en.wikipedia.org/wiki/Prim%27s_algorithm
2. Kruskal's Algorithm - https://en.wikipedia.org/wiki/Kruskal%27s_algorithm

The APIs for the algorithms can be as simple as,

1. minimum_spanning_tree(graph, algorithm) - This will return a new graph for the spanning tree.
2. minimum_spanning_tree_parallel(graph, algorithm, num_threads) - This will do the computation of the MST using given number of threads.

Example of the problem

References/Other comments

This issue is not open for contributors though anyone is free to comment on the APIs and review the code.

[czgdp1807]

First, Kruskal algorithm will be added before which disjoint set data structure will be added.

[HarsheetKakar]

Why is it not open for contributors?

[Disha5harma]

Sir, I want to work on this.Can you please assign me this?

[czgdp1807]

Hi @Disha5harma Please see issues labelled with gssoc20. This issue is open for comments on APIs but not for contributors to make PRs. Thanks.

[Disha5harma]

Okay.I will check it.

…

On Thu, Mar 12, 2020 at 11:29 AM Gagandeep Singh ***@***.***> wrote: Hi @Disha5harma <https://github.com/Disha5harma> Please see issues labelled with gssoc20. This issue is open for comments on APIs but not for contributors to make PRs. Thanks. — You are receiving this because you were mentioned. Reply to this email directly, view it on GitHub <#137 (comment)>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/AKOT7E3THJ6GKGXHGLSJ2KDRHB24HANCNFSM4LF2WFRQ> .

[abhishekgupta368]

I can do it with time and memory efficiency. can you please assign me?