minspantree.html

来自「数据结构词典（英文）」· HTML 代码 · 共 50 行

HTML
50 行
字号 
<!DOCTYPE HTML PUBLIC "-//IETF//DTD W3 HTML 2.0//EN">
<HTML lang="en-US">
<HEAD>
<TITLE>minimum spanning tree</TITLE>
<META name="description"
  content="Definition of minimum spanning tree,
	possibly with links to more information and implementations.">
<META name="keywords" content="minimum spanning tree">
</HEAD>
<BODY BGCOLOR="#FFFFFF">

<H1>minimum spanning tree</H1>
<P>
(definition)

<P>
<strong>Definition:</strong>
A minimum-weight <a href="tree.html" tppabs="http://hissa.nist.gov/dads/HTML/tree.html"><em>tree</em></a> in a <a href="weightgraph.html" tppabs="http://hissa.nist.gov/dads/HTML/weightgraph.html"><em>weighted graph</em></a> which contains all of the graph's <a href="vertex.html" tppabs="http://hissa.nist.gov/dads/HTML/vertex.html"><em>vertices</em></a>.
<P><strong>See also</strong>
<a href="kruskalsalgo.html" tppabs="http://hissa.nist.gov/dads/HTML/kruskalsalgo.html"><em>Kruskal's algorithm</em></a>, <a href="primsalgrthm.html" tppabs="http://hissa.nist.gov/dads/HTML/primsalgrthm.html"><em>Prim's algorithm</em></a>, <a href="steinermintr.html" tppabs="http://hissa.nist.gov/dads/HTML/steinermintr.html"><em>Steiner minimum tree</em></a>, <a href="spanningtree.html" tppabs="http://hissa.nist.gov/dads/HTML/spanningtree.html"><em>spanning tree</em></a>.
<P>Author: <a href="terms.html#authorJLG" tppabs="http://hissa.nist.gov/dads/terms.html#authorJLG">JLG</a>
<H2>Implementation</H2>
<A HREF="javascript:if(confirm('http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://www.cs.sunysb.edu/%7Ealgorith/files/minimum-spanning-tree.shtml  \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address.  \n\nDo you want to open it from the server?'))window.location='http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://www.cs.sunysb.edu/%7Ealgorith/files/minimum-spanning-tree.shtml'" tppabs="http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://www.cs.sunysb.edu/%7Ealgorith/files/minimum-spanning-tree.shtml">(C++, Pascal, Fortran, C, and Mathematica)</A>
<H2>More information</H2>
OR-Notes on graph theory, including <A HREF="javascript:if(confirm('http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://mscmga.ms.ic.ac.uk/jeb/or/graph.html  \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address.  \n\nDo you want to open it from the server?'))window.location='http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://mscmga.ms.ic.ac.uk/jeb/or/graph.html'" tppabs="http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://mscmga.ms.ic.ac.uk/jeb/or/graph.html">minimum spanning trees</A>.

<hr>

Go to the
<A HREF="terms.html" tppabs="http://hissa.nist.gov/dads/terms.html">Algorithms, Data Structures, and Problems</A>
home page.

<hr>

If you have suggestions, corrections, or comments, please get in touch
with
<a href="javascript:if(confirm('http://hissa.nist.gov/~black/black.html  \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address.  \n\nDo you want to open it from the server?'))window.location='http://hissa.nist.gov/~black/black.html'" tppabs="http://hissa.nist.gov/~black/black.html">Paul E. Black</a>
&nbsp;(<a href="mailto:paul.black@nist.gov">paul.black@nist.gov</a>).

<p>
Entry modified Thu Jul  1 08:47:24 1999.<BR>
HTML page formatted Wed Dec 22 09:35:51 1999.

<P>
This page's URL is
<A href="minspantree.html" tppabs="http://hissa.nist.gov/dads/HTML/minspantree.html">http://hissa.nist.gov/dads/HTML/minspantree.html</A>

</BODY>
</HTML>

minspantree.html - 源码说明

本页面展示了「数据结构词典（英文）」中的 minspantree.html 源码文件，采用 HTML 编程语言编写，共 50 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与数据结构相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?