void floyd_warshal(vector<vector<int>> v, int n) {
    vector<vector<int>> dist;
    vector<vector<int>> recor;
 
    //iniciar vector de vector
    vector<int> aux;
    for (int i = 0; i < n; i++)
        aux.push_back(INF);
 
    for (int i = 0; i < n; i++) {
        dist.push_back(aux);
        recor.push_back(aux);
    }
 
    for (int i = 0; i<n; i++) {
        for (int j = 0; j<n; j++) {
            recor[i][j] = j;
        }
    }
 
    for (int i = 0; i<n; i++)
        for (int j = 0; j<n; j++)
            dist[i][j] = v[i][j];
 

    for (int k = 0; k<n; k++) {
        for (int i = 0; i<n; i++) {
            for (int j = 0; j<n; j++) {
                if (dist[i][k] + dist[k][j]<dist[i][j]) {
                    dist[i][j] = dist[i][k] + dist[k][j];
                    recor[i][j] = k;
                }
            }
        }
    }
    cout << "Tabla de Distancia: " << endl << endl;
    dibujar(dist);
    cout << endl;
    cout << "Tabla de Recorrido: " << endl << endl;
    dibujar(recor);
}