algoritmo de warshall 1
TRANSCRIPT
![Page 1: Algoritmo de warshall 1](https://reader035.vdocuments.pub/reader035/viewer/2022081209/5598bb141a28abac4a8b4757/html5/thumbnails/1.jpg)
ALGORITMO DE WARSHALL
• Encuentra si es posible un camino entre cada uno de los vértices de la gráfica dirigida. Es decir no presenta las distancias entre los vértices.
• Se basa en un concepto llamado cerradura transitiva de la matriz de adyacencia.
![Page 2: Algoritmo de warshall 1](https://reader035.vdocuments.pub/reader035/viewer/2022081209/5598bb141a28abac4a8b4757/html5/thumbnails/2.jpg)
ALGORITMO DE WARSHALL
Sea la gráfica dirigida G(V,A) y su matriz de adyacencia M. donde
M[i,j]=1 Si existe un arco de I a j M[ij]=0 Si no existe arco de I a j
![Page 3: Algoritmo de warshall 1](https://reader035.vdocuments.pub/reader035/viewer/2022081209/5598bb141a28abac4a8b4757/html5/thumbnails/3.jpg)
ALGORITMO DE WARSHALLALGORITMO DE WARSHALL
AB
C
D
![Page 4: Algoritmo de warshall 1](https://reader035.vdocuments.pub/reader035/viewer/2022081209/5598bb141a28abac4a8b4757/html5/thumbnails/4.jpg)
MATRIZMATRIZ
AA BB CC DD
AA 00 11 00 00
BB 00 00 11 00
CC 11 00 00 11
DD 00 00 00 00
![Page 5: Algoritmo de warshall 1](https://reader035.vdocuments.pub/reader035/viewer/2022081209/5598bb141a28abac4a8b4757/html5/thumbnails/5.jpg)
PIVOTE APIVOTE A
AA BB CC CC
AA 00 11 00 00
BB 00 00 11 00
CC 11 11 00 11
CC 00 00 00 00
![Page 6: Algoritmo de warshall 1](https://reader035.vdocuments.pub/reader035/viewer/2022081209/5598bb141a28abac4a8b4757/html5/thumbnails/6.jpg)
PIVOTE BPIVOTE B
AA BB CC DD
AA 00 11 11 00
BB 00 00 11 00
CC 11 11 11 11
DD 00 00 00 00
![Page 7: Algoritmo de warshall 1](https://reader035.vdocuments.pub/reader035/viewer/2022081209/5598bb141a28abac4a8b4757/html5/thumbnails/7.jpg)
PIVOTE C
A B C D
A 1 1 1 1
B 1 1 1 1
C 1 1 1 1
C 0 0 0 0
![Page 8: Algoritmo de warshall 1](https://reader035.vdocuments.pub/reader035/viewer/2022081209/5598bb141a28abac4a8b4757/html5/thumbnails/8.jpg)
Por Carmen Nereira