CLASE PRINCIPAL
package ejemplo_grafo;
long matriz[][]={{0,3,4,999999999,8,999999999},
{999999999,0,999999999,999999999,5,999999999},
{999999999,999999999,0,999999999,3,999999999},
{999999999,999999999,999999999,0,999999999,999999999},
{999999999,999999999,999999999,7,0,3},
{999999999,999999999,999999999,2,999999999,0}};
Grafo ruta_camino = new Grafo();
System.out.println(ruta_camino.algoritmo(matriz));
}
SUB CLASE
package ejemplo_grafo;
}
//Agregando el camino minomo a cadena;
for ( i = 0; i <vertice; i++) {
for (j = 0; j <vertice; j++) {
cadena = cadena + "["+matrizAdyacente[i][j]+"]";
}
cadena = cadena +"\n";
}
for ( i = 0; i <vertice; i++) {
for (j = 0; j <vertice; j++) {
if(matrizAdyacente[i][j] != 1000000000){
if( i != j){
if(caminos[i][j].equals("")){
caminitos += "De ("+(i+1)+"--->"+(j+1)+" Irse por...("+(i+1)+",
"+(j+1)+")\n";
}else{
caminitos += "De ("+(i+1)+"--->"+(j+1)+" Irse por...("+(i+1)+",
"+caminos[i][j]+",
"+(j+i)+")\n";
}
}
}
}
}
return "La matriz mas cortos entre los diferente vertices es:\n"+cadena+
"\nlos diferentes caminos mas cortos entre vertices son:\n"+caminitos;
}