图与遍历算法研究及网络可靠性分析.pdfVIP

ComputerAlgorithmDesignand

Analysis

Chapter2Graphsand

traversalalgorithms

MaBingpeng

September22,2015

第二章图与遍历算法

2.1图本概念和性质

2.2图历算法

2.3双图与网络可靠性

2.4对

Chapter2Graphsand

traversalalgorithms

2.1Basicconceptsandpropertiesofdiagrams

2.2Graphtraversalalgorithm

2.3Dual-connectiondiagramandnetworkreliability

2.4

Counter

measuretree

6

4

1

图2.11通图

结点2发生故障，结点被“”

6

Figure2.11Aconnected

diagram

结点2Failureoccurs,nodeisisolated

1.问题描述

–通信网

图中结点表示通信站，边表示通信线路。

1212连通程度

不一样！

4343

2.12一个双连通图

结点发生故障不影响

其它结点间的通信

2.3Dual-connectiondiagramand

networkreliability

1.ProblemDescription–Thenodeinthecommunication

networkdiagramrepresentsthecommunicationstationand

theedgerepresentsthecommunicationline.

1212连通程度

不一样！

4343

Figure2.12A

dual-connectiondiagramNodefailuredoesnotaffect

com