📄 text9-27.htm
字号:
<html>
<head>
<title>Untitled Document</title>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
</head>
<body bgcolor="#FFFFFF" link="#0000FF" vlink="#3399FF" alink="#FF0066">
<div id="Layer1" style="position:absolute; width:711px; height:21px; z-index:1; top: 10px; background-color: #CCCCCC; layer-background-color: #CCCCCC; border: 1px none #000000; left: 26px"><b>|</b><font face="宋体" size="2"><a href="../text1/text1-0.htm">第一章</a></font><b>|</b><font face="宋体" size="2"><a href="../text2/text2-0.htm">第二章</a></font><b>|</b><font face="宋体" size="2"><a href="../text3/text3-0.htm">第三章</a></font><b>|</b><font face="宋体" size="2"><a href="../text4/text4-0.htm">第四章</a></font><b>|</b><font face="宋体" size="2"><a href="../text5/text5-0.htm">第五章</a></font><b>|</b><font face="宋体" size="2"><a href="../text6/text6-0.htm">第六章</a></font><b>|</b><font face="宋体" size="2"><a href="../text7/text7-0.htm">第七章</a></font><b>|</b><font face="宋体" size="2"><a href="../text8/text8-0.htm">第八章</a></font><b>|</b><font face="宋体" size="2">第九章</font><b>|</b><font face="宋体" size="2"><a href="../text10/text10-0.htm">第十章</a></font><b>|</b><font size="2" face="宋体"><a href="../textA/textA-0.htm">算法分析</a><b><font color="#000000">|</font></b>
</font></div>
<pre align="left">
<b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">(5) <font color="#FF0000">Application of F-heaps</font>
* <i><font color="#0033CC">the single source all destinations algorithm</font></i>
S -- the set of vertices to which a shortest path has been found
dostance(i) -- the length of a shortest from the source vertex i, i
<img src="image/-s.gif" width="17" height="23" align="middle"> ~ F-hearp
1) determine i is min distance and add i to S
~~ a delete min operation on <img src="image/-s.gif" width="17" height="23" align="middle">
2) distance value of the remaining vertices in <img src="image/-s.gif" width="17" height="23" align="middle">
~~ a decrease key operation on each of the affected
verties
total time (graph ) -- <img src="image/wB.gif" width="17" height="17"> (<img src="image/n2.gif" width="21" height="20" align="middle"> )
total time (heap ) -- O (nlog n + e )
* find a shortest path between every pair of vertices
total time (graph ) -- <img src="image/wB.gif" width="17" height="17"> ( <img src="image/n3.gif" width="19" height="20" align="middle"> )
total time (heap ) -- O (<img src="image/n2.gif" width="21" height="20" align="middle"> log n + ne ) </font></b></pre>
<p> </p>
<table width="731" cellspacing="0" cellpadding="0">
<tr>
<td width="327"> </td>
<td width="271"><a href="../index.htm"><img width="60" height="25" usemap="#MapMap4" border="0" src="../../images/home.gif"></a><a href="../index.htm"><map name="MapMap4"><area shape="rect" coords="42,-34,88,-15" href="text0.htm"><area shape="rect" coords="4,4,55,23" href="text9-index.htm"></map></a></td>
<td width="131"><font face="楷体_GB2312" size="2"><b><a href="text9-26.htm">上一页</a>
</b></font></td>
</tr>
</table>
<p> </p>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -