pathfinding icon indicating copy to clipboard operation
pathfinding copied to clipboard

Add Implementation for Prim's algorithm

Open jafar75 opened this issue 6 months ago • 1 comments

Hi there, It is known that Kruskal's algorithm for finding MST, has a simpler implmentation than Prim's and also is more efficient for sparse graph. If it is needed, I'm willing to implement prim's algorithm, as it is more suitable when the graph is dense. useful link

jafar75 avatar Aug 08 '24 21:08 jafar75