Dijkstra's Algorithm
Name:
Anonymous
2011-04-28 15:44
int h = 0;
loop1:
if (h < n) {
int i = 0;
loop2:
if (i < n) {
int j = 0;
loop3:
if (j < n) {
if (distance[i][h] + distance[h][j] < distance[i][j]) {
distance[i][j] = distance[i][h] + distance[h][j];
path[i][j] = h;
}
j++;
goto loop3;
}
i++;
goto loop2;
}
h++;
goto loop1;
}
Name:
Anonymous
2011-04-28 15:45
goto
OH UR SO SMART DICKSTRAP ALGORITM BUT U USD GOTO LOL ARCHIVE TIS SHIT TOASTING IN EPIC BREAD
Get the fuck out and learn to use code tags.
Name:
Anonymous
2011-04-28 17:21
Why did you unfold the for loop?
Name:
Anonymous
2011-04-28 17:29
VICTORY TO THE FARTISTS!
Name:
Anonymous
2011-04-28 17:33
VICTORY TO THE FARTISTS!
Name:
Anonymous
2011-04-28 17:33
VICTORY TO THE FARTISTS!
Name:
Anonymous
2011-04-28 17:35
VICTORY TO THE FARTISTS!
Name:
Anonymous
2011-04-28 19:20
VICTORY TO THE FARTISTS!
Name:
Anonymous
2011-04-28 19:33
But whom will save Xarn?
Name:
Anonymous
2011-04-28 19:46
Why does this algorithm have an n3 runtime?
Name:
Anonymous
2011-04-28 19:50
But whom will save Xarn?
Name:
Anonymous
2011-04-28 20:25
n3
Reads: N-threebed
Name:
Anonymous
2011-04-28 22:24
Name:
Anonymous
2011-04-29 3:43
npomf
Name:
Anonymous
2011-04-29 6:31
abc
Name:
Anonymous
2011-04-30 6:21