Notebook for Minimum Spanning Tree Algorithms

[PurviChaurasia]

In NetworkX, MSTs are generated via 3 different algorithms:

1. Kruskals Algorithm
2. Prims Algorithm
3. Boruvka Algorithm

I aim to create a notebook explaining how each algorithm works in NetworkX while making it as simple and understandable as possible.

[PurviChaurasia]

@MridulS @rossbar Should I create a sample draft notebook before adding it into the proposal? Also would it be a good idea to consider it for the proposal or should I look into other algorithms?

[PurviChaurasia]

@MridulS Could you have a look at this notebook, I don't want to commit any changes yet because I have to convert to MD format first. Please let me know how I can improve this.

[PurviChaurasia]

I know you guys are super swamped but any inputs from your end would be great! @rossbar @MridulS

[MridulS]

@PurviChaurasia There is no need to have a nx-guides notebook ready before the outreachy deadline. We don't expect applicants to do that :)

[PurviChaurasia]

Oh alright, sure. But do you think it's a good algorithm to work on for the proposal? I have also added 2 other issues around which I would like to work, could you kindly have a look at them and let me know if adding them to the proposal would be alright?

[PurviChaurasia]

I am applying via GSoC as well hence would like to get your approval on these things before working on my final proposal :)

[MridulS]

Minimum spanning tree and related algorithms is definitely a good candidate for the notebooks.

[PurviChaurasia]

Alright thanks a lot for the heads-up!