Anonymous
Not logged in
Log in
Rice Wiki
Search
Minimum Spanning Tree
From Rice Wiki
Namespaces
Page
Discussion
More
More
Page actions
Read
View source
History
Revision as of 00:56, 6 March 2024 by
Rice
(
talk
|
contribs
)
(
diff
)
← Older revision
|
Latest revision
(
diff
) |
Newer revision →
(
diff
)
A
minimum spanning tree
is
a tree, meaning it has no cycle
minimum, meaning it has minimum weight
spanning, meaning it connects all nodes
Category
:
Algorithms
Navigation
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Wiki tools
Wiki tools
Special pages
Page tools
Page tools
User page tools
More
What links here
Related changes
Printable version
Permanent link
Page information
Page logs
Categories
Categories
Algorithms