feat: add prim algorithm to find mst

[jafar75]

Prim's algorithm is one of the most well known algms for finding minimum spanning tree of a weighted undirected graph, alongside Kruskal's algorithm. I thought it is better to implement it, and repo users can now use both of these algorithms and maybe do any comparison for educational purposes.

to implement the algorithm more efficiently, built-in binary heap in container/heap is used as a priority queue.

[codecov-commenter]

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 86.65%. Comparing base (237d88f) to head (230b23e).

Additional details and impacted files

@@            Coverage Diff             @@
##           master     #710      +/-   ##
==========================================
+ Coverage   86.58%   86.65%   +0.07%     
==========================================
  Files         196      197       +1     
  Lines        6483     6519      +36     
==========================================
+ Hits         5613     5649      +36     
  Misses        730      730              
  Partials      140      140              

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.