全ぜん域いき木ぎ

noun

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.