text6-13.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"><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"><b>
⑵<font color="#FF0000">Breadth first search</font>
typedef struct queue *queue_pointer;
typedef struct<font color="#FF0000"> queue </font>{ int vertex;
			         queue_pointer; };
void addq (queue_pointer *, queue_pointer *,  int);
int deleteq ( queue_pointer *);
void <font color="#FF0000">bfs</font>(int v)
{<i><font size="3" color="#CC0099">/* breadth first traversal of a graph,starting with node v
the global array visited is initialized to 0, the queue
operations are similar to those described in chapter 4. */</font></i></b></font></pre>
<table width="756" cellspacing="0">
  <tr> 
    <td width="510"> 
      <pre><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"><b>        node_pointer w;
        queue_pointer front,rear;
        front = rear = NULL;        <i><font size="3" color="#CC0099">/* initialize queue */</font></i>
        printf ("%5d", v);
        visited[v] = TRUE;
        addq (&front,&rear,v);            
        while (front)  
             { v = deleteq (&front);
                for (w = graph[v]; w; w = w->link)
                     if ( !visited [w->vertex]){    
                           printf ("%5d",w->vertex);
                           addq (&front, &rear, w->vertex);
                           visited [w->vertex] = TRUE;
              }
        }          
}</b></font></pre>
    </td>
    <td width="240"> 
      <pre><img src="image/levelorder.gif" width="224" height="329"></pre>
    </td>
  </tr>
</table>
<pre align="left"><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"><b>     
<font color="#FF0000">complexity</font>
    for adjacency list ,        O (e)
    for adjacency matrix ,   <img src="image/on2.gif" width="67" height="26"></b></font>

</pre>
<table width="731" cellspacing="0" cellpadding="0">
  <tr> 
    <td width="327">&nbsp;</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-12.htm">上一页</a> 
      <a href="text6-14.htm">下一页</a> </b></font></td>
  </tr>
</table>
<pre align="left">&nbsp;
</pre>
</body>
</html>

text6-13.htm - 源码说明

本页面展示了「浙江大学计算机学院数据结构课程的教学课件」中的 text6-13.htm 源码文件，采用 HTM 编程语言编写，共 64 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

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

⌨️ 快捷键说明

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