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.
std::set and std::map store elements in sorted order using a balanced binary search tree (typically a Red-Black Tree).