LeetCode 1135 with Prims

[c2khanna]

Hi,

I've been working through LeetCode questions and your repo has been super useful to look at better solutions. I was working on LeetCode # 1135 (Connecting Cities with Minimum Cost) and was wondering if there is a way to use Prim's algorithm to solve it. Is there any particular reason to use Kruskal's vs Prim's?

If not, would you recommend a different question that will help me better understand prims algo.

Thanks for your help.