Concepts2
⚙️AlgorithmIntermediate
Minimum Spanning Tree - Prim
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.
#prim#minimum spanning tree#mst+12
🗂️Data StructureIntermediate
Ordered Set and Map
std::set and std::map store elements in sorted order using a balanced binary search tree (typically a Red-Black Tree).
#ordered set#ordered map#std::set+12