Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int i, j = 0,k=0;
- for (i = 0; i < g->n; i++){
- for (j = 0; j < g->n; j++){
- if (g->M[i][j] != FLT_MAX){//Part du principe qu'il est -FLT_MAX à ce stade
- margeGraphe[k].ml = tot->V[j] - g->M[i][j] - tot->V[i];
- margeGraphe[k].mt = tard->V[j] - g->M[i][j] - tot->V[i];
- margeGraphe[k].nd = i;
- margeGraphe[k].na = j;
- k++;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement