text6-4.htm
来自「浙江大学计算机学院数据结构课程的教学课件」· HTM 代码 · 共 42 行
HTM
42 行
<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">v0 and v1 are connected</font><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"> ----- there is a path from v0 to v1
<font color="#FF0000">an undirected graph are connected</font> ------
if , for every pair of distinct vertices vi , vj , there is a
path from vi to vj in G.
<img src="image/text6-e.gif" width="281" height="109">
<font color="#FF0000">connected component<font color="#000000"> ( undirected graph)</font></font><font color="#000000"> </font>-----
a maximal connected subgraph. ( a tree is graph
that is connected and acycle)
<font color="#FF0000">strongly connected</font> ( directed graph ) ------
if , for every pair of vertices vi , vj in G, there is a
path from vi to vj , and also from vj to vi.
<font color="#FF0000">strongly connected component</font> -----
a maximal subgraph that is strongly connected.
<img src="image/text6-g.gif" width="168" height="61">
<font color="#FF0000">degree of vi </font>---- the number of edges incident to that vertex.
<font color="#FF0000"> in-degree</font> ---- the number of edges that have v as the head.
<font color="#FF0000"> out-degree</font> ---- the number of edges that have v as the tail.
<font color="#0033CC">the number of edges</font> : <img src="image/text6-f.gif" width="94" height="36" vspace="0" hspace="0" align="absmiddle"> </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-3.htm">上一页</a>
<a href="text6-5.htm">下一页</a> </b></font></td>
</tr>
</table>
<p> </p>
</body>
</html>
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?