Algoritam Ford Bellman-a
``` graph->edge[1].weight = 4; // add edge 1-2 (or B-C in above figure) graph->edge[2].src = 1; graph->edge[2].dest = 2; graph->edge[2].weight = 3; // add edge 1-3 (or B-D in above...
Informacione tehnologije
16 stranica
Informacione tehnologije, Seminarski radovi, Skripte
Objavio veselizmaj
·
