Skip to content

Instantly share code, notes, and snippets.

@luccasiau

luccasiau/floyd-warshall_pseudo

Last active August 29, 2015 14:20
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save luccasiau/02b20c9ca1453776621c to your computer and use it in GitHub Desktop.
Save luccasiau/02b20c9ca1453776621c to your computer and use it in GitHub Desktop.
Download ZIP
Raw
floyd-warshall_pseudo
// a matriz distancia[][] irá ser inicializada
// como sendo igual a matriz de adjacencia do grafo
para todo k de 1 a N:
para todo i de 1 a N:
para todo j de 1 a N:
distancia[i][j] = minimo( distancia[i][j], distancia[i][k] + distancia[k][j] )
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment