Groups
Category
SPFA is a queue-based optimization of Bellman–Ford that only relaxes edges from vertices whose distance just improved.
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.