spanning tree
Technical term in graph theory: a subgraph that includes all vertices of the original graph and is a tree.
The minimum spanning tree problem is often used in network design.
Compound of 全域 (ぜんいき, 'whole area') + 木 (ぎ, 'tree'), a direct translation of the English mathematical term 'spanning tree'.