🌲A complete graph is fully meshed, with every pair of vertices connected by a line.
🔗A spanning tree is a minimally connected graph without loops, formed from a complete graph.
🌐Spanning tree protocol (STP) is a layer 2 protocol that prevents loops in network topology.
🏢STP selects a root bridge, determines path costs, and blocks redundant links to eliminate loops.
💡STP provides fault tolerance by activating blocked links if active links fail.