[pgrouting-dev] GSoc'18 Week 06 Report - Implement MST and Mincut

Hello All,

This is my report for week 6 (June 18 - June 24).

What did you get done this week? Implemented the kruskal algorithm and then add the connected component to get the minimum spanning tree of each subgraph.
Detailed can be found here [1] and PR can be found here [2].

What do you plan on doing next week?

  • Refine signature and add test, documentation and pgTAP.

Are you blocked on anything?

No, at the moment I’m not blocked.

The wiki page can be found in [3]

The repository can be found in [4]

[1] https://github.com/pgRouting/pgrouting/wiki/GSoC-2018-MST-and-Mincut#week-6
[2] https://github.com/pgRouting/pgrouting/pull/1051

[3] https://github.com/pgRouting/pgrouting/wiki/GSoC-2018-MST-and-Mincut

[4] https://github.com/pgRouting/pgrouting/tree/gsoc/mincut


Aditya Pratap Singh