shortestpath.html

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

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

<H1>shortest path</H1>
<P>
(classic problem)

<P>
<strong>Definition:</strong>
The problem of finding the shortest <a href="path.html" tppabs="http://hissa.nist.gov/dads/HTML/path.html"><em>path</em></a> from one  <a href="vertex.html" tppabs="http://hissa.nist.gov/dads/HTML/vertex.html"><em>vertex</em></a> in a <a href="graph.html" tppabs="http://hissa.nist.gov/dads/HTML/graph.html"><em>graph</em></a> to another vertex.  "Shortest" may be least number of <a href="edge.html" tppabs="http://hissa.nist.gov/dads/HTML/edge.html"><em>edges</em></a>, least total weight, etc.
<P><strong>See also</strong>
<a href="dijkstraalgo.html" tppabs="http://hissa.nist.gov/dads/HTML/dijkstraalgo.html"><em>Dijkstra's algorithm</em></a>, <a href="bellmanford.html" tppabs="http://hissa.nist.gov/dads/HTML/bellmanford.html"><em>Bellman-Ford algorithm</em></a>, <a href="allpairsshrt.html" tppabs="http://hissa.nist.gov/dads/HTML/allpairsshrt.html"><em>all pairs shortest path</em></a>.
<P>Author: <a href="terms.html#authorPEB" tppabs="http://hissa.nist.gov/dads/terms.html#authorPEB">PEB</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/shortest-path.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/shortest-path.shtml'" tppabs="http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://www.cs.sunysb.edu/%7Ealgorith/files/shortest-path.shtml">(C, C++, Pascal, Fortran, and Mathematica)</A>
<H2>More information</H2>
OR-Notes on network flow, including <A HREF="javascript:if(confirm('http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://mscmga.ms.ic.ac.uk/jeb/or/netflow.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/netflow.html'" tppabs="http://www.nist.gov/cgi-bin/exit_nist.cgi?url=http://mscmga.ms.ic.ac.uk/jeb/or/netflow.html">shortest path</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:58:49 1999.<BR>
HTML page formatted Wed Dec 22 09:36:29 1999.

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

</BODY>
</HTML>

shortestpath.html - 源码说明

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

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

⌨️ 快捷键说明

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