1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
|
for (int i= 1; i<=6 ; i++)
{
ant_pkt ant_pkt(sourc, dest , 0, i );
int type = ant_pkt.get_type();
int t=(unsigned int)time(0);
do
{
printf("debut\n");
n=rtable_.calc_next(k, parent, que);
wait_on_queue(type, k , n, 1);
printf("parcours \n");
cross_the_link(k, n);
int t_1 = (unsigned int)time(0);
t_k_n = (unsigned int)difftime(t_1, t);
ant_pkt.delete_memory(n);
ant_pkt.add_memory(n,t_k_n);
parent=k;
k = n;
}while (k != dest);
ant_pkt.affichage_du_memoire();
ant_pkt.become_backward_ant();
type = ant_pkt.get_type();
int initialtt = t_k_n ;
for(int i=ant_pkt.get_size_list()-2;i>=0;i--)
{
update_traffic(ant_pkt, i, initialtt);
update_table(ant_pkt,i);
}
} |
Partager