1
:
2
3
0 1 2 k k
i i i i
i i−1 i i
0 k
4
0 1 2 k-1 k k
i−1 i
5
6
7.
8.
9.
0 k
7
i-1
i i i-1
0 k
.
8
3 6
1 2 4
2 2 3
Figure 1 : walk in undirected graph
5 2 1 3
9
Figure 2 : walk and path in directed graph
10
0 1 1 k-1 k k 0 1 1 k-1 k k 0
k
11
o 1 k
i
12
2 4 3 is an elementary cycle of length 3.
1 ) represents an elementary cycle of length 1
3 3
Figure 3 : walk inundirected Graph
13
0 1 1 k-1 k k 0 k
14
15
(1,a3,2 ,a6,5,a5,4,a2,1 ) ) is an elementary cycle of length 4.
(6,a9, 6 ) is an elementary circuit of length 1.
(1,a1,4,a4,2,a6,5,a5,4,a2,1) ) is a non-elementary circuit of length 5.
Figure4 : walk and path in directed Graph
16
17
1 2 p
1 2 p
18
Figure 3 : Graph with 3 connected components
Figure 4 : connected graph (with 1 connected
component)
19
20
21
22
Let G=(V,E) be the connected graph shown in Figure 5.
Figure 5 : a 1-connected graph (κ(G)=1), 2-edge-connected graph (λ(G)=2),With a minimum
degree of 3.
23
24
1 2
25
1 2 p 1 2 p
26
27
28
29
Algorithme Recherche des Composantes Fortement Connexes
Entrée: Un graphe orienté G = (V, A).
Sortie: Les composantes fortement connexes du graphe G.
XV
30
31
R R R
R
R i j i j
R
32
Figure 6 : Graph with 2 strongly connected
componenets
Figure 7 : Reduced graph G.
33
34
35
36
G1 G2 G3
Figure 8 : Example of eulerian, se,I eulerian an not eulerian graph
37
o
38
Figure 9 : Semi eulerian digraph.
39
40
o 1 2 n 1
41
Figure 10 : Hamiltonien Graph
42
Figure 3.11 : non Hamiltonien Graph
