text6-3.htm
来自「浙江大学计算机学院数据结构课程的教学课件」· HTM 代码 · 共 41 行
HTM
41 行
<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="#FF0000">subgraph of G (G') ----- <i><font color="#000000">V(G') V(G) and E(G') E(G)</font></i>
<font color="#000000"> <img src="image/text6-b1.gif" width="86" height="206"> <img src="image/text6-d.gif" width="382" height="216">
<font color="#FF0000">path from vp to vq </font>
----- a sequence of vertices <i>vp , vi1 , vi2 , … , vin , vq
</i>such that in an undirected graph<i><font color="#0033CC">
( vp , vi1 ), ( vi1 , vi2 ),…, ( vin , vq )</font></i> are edges.
in directed graph, the path consists of <font color="#0033CC"><i>
</i></font> <font color="#0033CC"><i>< vp , vi1 >, < vi1 , vi2 >,…, < vin , vq > </i></font>
<font color="#FF0000">length of a path </font>---- the number of edges on the graph
<font color="#FF0000">simple path </font> ---- a path in which all vertices, except possibly
the first and the last are distinct.
<font color="#FF0000">simple directed path</font>
<font color="#FF0000">cycle </font> ---- a simple path in which the first and the last
vertices are the same.
<font color="#FF0000">directed cycle
</font></font></font></b></pre>
<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-2.htm">上一页</a>
<a href="text6-4.htm">下一页</a> </b></font></td>
</tr>
</table>
</body>
</html>
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?