Professional Documents
Culture Documents
Rapport Travaux Pratique D'Optimisation Et Planification Des Reseaux
Rapport Travaux Pratique D'Optimisation Et Planification Des Reseaux
Paix-Travail-Patrie Peace-Work-Fatherland
********* *********
MINISTERE DE L’ENSEIGNEMENT MINISTRY OF HIGHER
SUPERIEUR EDUCATION
********** **********
ECOLE NATIONALE SUPERIEUR DES POSTES NATIONAL ADVANCED SCHOOL OF POSTS
DES TELECOMMUNICATIONS ET DES TIC TELECOMMUNICATIONS AND ICT
**********
Rédigé par :
Interprétation :
S= [1 1 1 2 2 3 3 4 4 4 5 5 6 6 7 7 8 9]: define the source nodes of
each edge in the graph
permet d’attribuer un
names={'A' 'B' 'C' 'D' 'E' 'F' 'G' 'H' 'I' 'J'} :
nom a chaque nœud d’où A=1 B=2 C=3 D=4 E=5 F=6 G=7 H=8 I=9 J=10
G=graph (S,T,weights, names):specifies node names using the cell array,
of character vectors or string array, nodenames. S and T cannot
contain node names that are not in nodenames
highlight the
highlight(p,T, 'EdgeColor','black','LineWidth',3):
minimum spanning tree subgraph in the plot by increasing the line
width and changing the color of the edges in the tree
3. Graphique résultant
create a
rootedTree = graph(pred(pred~=0),find(pred~=0),[],G.Nodes.Name):
directed version of minimum spanning tree. All of the edges in this
tree are directed away from the root nodes in each component
highlight by
highlight(p,rootedTree,'EdgeColor','m','LineWidth',3):
increasing the line width and changing the color of the edges in the
tree
1. Création du graphe
On obtient donc:
Ainsi Le Minimum Cut trouvé est : (S-B); (S-C); (C-F); (B-E); (G-T); (S-
C); (E-T).