Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03155651n
Noun Concept
JA
最小全域木
EN
A minimum spanning tree or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. Wikipedia
Relations
Sources
IS A
全域木
EN
weighted graph
HAS KIND
EN
Euclidean minimum spanning tree
EN
rectilinear minimum spanning tree
STUDIED BY
グラフ理論
Wikidata
JA
最小全域木

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License