|
"%d\n", j + 1);
}
}
fprintf(ofp, "\n");
}
// to print nodes on path
void path(int q, int r, FILE *ofp)
{
if(P[q - 1][r - 1] != 0) {
path(q, P[q - 1][r - 1], ofp);
fprintf(ofp, "%d -> ", P[q - 1][r - 1]);
path(P[q - 1][r - 1], r, ofp);
}
} << routing algorithm >>
<< data >>
<< shortest
|
|
메뉴펼치기
