text6-21.htm
来自「浙江大学计算机学院数据结构课程的教学课件」· HTM 代码 · 共 64 行
HTM
64 行
<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">第六章</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"><a href="../text9/text9-0.htm">第九章</a></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">
<font color="#FF0000">global declarations: </font>
#define MIN2 (x, y) ((x ) < ( y ) ? (x) : (y))
short int dfn [MAX_VERTICES ];
short int low [MAX_VERTICES ];
int num;
void <font color="#FF0000">bicon</font>( int u, int v) <font color="#FF0000"> O(n + e )</font>
{<i><font size="3" color="#CC0099">/* compute dfn and low,and output the edges of G by theirbiconnected
component, v is the parent (if any) of the u {if any) in the resulting spanning
tree.It is assumed that all entries of dfn[] have been initialized to -1,num
has been initialized to 0,and the stack has been set to empty*/ </font></i></font></b></pre>
<table width="69%" cellspacing="0" height="39">
<tr>
<td width="50%">
<pre><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"> node_pointer ptr;
int w,x,y;
dfn[u] = low[u] = num++;
for (ptr = graph[u]; ptr; ptr = ptr->link){
w = ptr->vertex;
if(v!= w && dfn[w] < dfn[u])
<font color="#0033CC">add</font> (&top, u, w); <i><font size="3" color="#CC0099"> /* add edge to stack */</font></i>
if ( dfn [ w ] < 0) { <i><font size="3" color="#CC0099"> /* w has not been visited * / </font></i>
<font color="#FF0000">bicon</font>(w,u);
low[u] = <font color="#0033CC">MIN2</font>(low[u],low[w]);
if (low[w] >= dfn[u]{
printf ("New biconnected component:");
do { <i><font size="3" color="#CC0099">/* delete edge from stack */</font></i>
<font color="#0033CC"> delete</font> (&top, &x, &y);
printf (" <&d,&d>",x,y);
} while ( !((x == u) && ( y == w)));
printf ("\n");
}
}
else if (w != v) low[u] = <font color="#0033CC">MIN2</font>(low[u], dfn[w]);
}
}</font></b></pre>
</td>
<td width="50%"><img src="IMAGE/text6-r3.gif" width="126" height="149"></td>
</tr>
</table>
<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="text6-index.htm"></map></a></td>
<td width="131"><font face="楷体_GB2312" size="2"><b><a href="text6-20.htm">上一页</a>
<a href="text6-22.htm">下一页</a> </b></font></td>
</tr>
</table>
<p> </p>
<pre align="left"><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"> </font></b></pre>
</body>
</html>
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?