Groups
Category
Prim's algorithm builds a Minimum Spanning Tree (MST) by growing a tree from an arbitrary start vertex, always adding the lightest edge that connects the tree to a new vertex.
Dijkstra's algorithm finds shortest path distances from one source to all vertices when all edge weights are non-negative.