Академический Документы
Профессиональный Документы
Культура Документы
Definition:
1.
Path
2.
Circuit
3.
Example 1:
a
i)
a-d-c-f-e
ii)
d-e-c-a
iii)
b-c-f-e-b
iv)
a-b-e-d-a-b
Exercise:
Does each of these lists of vertices form a path in the following graph? Which paths are
simple? Which are circuits? What are the lengths of those that are paths?
a)
i)
a-e-b-c-b
ii)
a-e-a-d-b-c-a :
iii)
e-b-a-d-b-e
iv)
c-b-d-a-e-c
b)
a
i)
a-b-e-c-b
ii)
a-d-a-d-a
iii)
a-d-b-e-a
iv)
a-b-e-c-b-d-a :
Example 2:
a
c
d
g
G1
G2
G1 is connected because for every pair of distinct vertices, there is a path between
them.
G2 is not connected. For instance, there is no path in G2 between vertices a and d.
1.
2.
between two vertices when the directions of the edges are disregarded.
Any strongly connected graph is also weakly connected.
Example 3:
a
b
c
G is strongly connected because there is a path between any two vertices in this
directed graph. Hence, G is also weakly connected.