dist [0] = 0;
Seuraava [0] = '*';
(i = 1; i
{
tila [i] = '? ";
dist [i] = [i] [0];
Seuraava [i] = v0;
}
/* JALOSTUS * /
(j = 0; j
{
//PRINTING
printf ("\\ nVERTEX | ");
(i = 0; i
printf ("% c \\ t ", v [i]);
printf (" \\ n ") ;
(i = 0; i
printf ("---------");
printf ("\\ nSTATUS |");
(i = 0; i
printf ("% c \\ t", tila [i]);
printf ("\\ nDIST |");
(i = 0; i
printf ("% d \\ t", dist [i]);
printf ("\\ nSeuraava |");
(i = 0; i
printf ("% c \\ t", seuraava [i]);
/* PROCESS * /
jos (j
{
(i = 1; i
jos (tila [i] == '?')
{
min = dist [i];
r = i;
break;
}
(i = 0; i
jos (tila [i] == '?' && dist [i]
{
min = dist [i];
r = i;
}
v1 = v [r];
tila [r] = '!';
(i = 0; i
{
jos (tila [i] == '?' && dist [i]> (acc [r] + [r] [i]))
{
dist [i] = dist [r] + [r] [i];
Seuraava [i] = v1;
}
}
getch ();
}
printf ("\\ n \\ n");
}
printf (" \\ n \\ nOsoitteen reunat sisältyy veneen hallinta puu ovat: - \\ n \\ n ");
(i = 1; i
printf ("% c% c ", seuraava [ ,,,0],i], 65 + i);
printf ("\\ n \\ n ** PAINO vähäinen veneen hallinta puu =");
(i = 1; i
< p> {
(j = 0; j
{
jos (seuraava [i] == v [j])
{
jos (i == n-1)
printf ("% d", [j] [i]);
muu
printf ("% d +", [j] [i]);
s = s + [j] [i];
break;
}
}
}
printf ("\\ n \\ t \\ t \\ t \\ t =% d", s);
getch ();
printf ("\\ n \\ nSHORTEST ETäISYYS \\ n");
(i = n-1; i> 0; i--)
{
printf ("\\ n \\ t \\ t% C ->% c =% C ->% c", v [i], v0, v [i], seuraava [i]);
v1 = seuraava [i];
(j = n-1, V1! = ''; j--)
{
jos ( v [j] == V1)
{
printf ("->% c", seuraava [j]);
v1 = seuraava [j];
}
}
printf ("= -", dist [i]);
}
getch ();
}
Lähtö: -
DIJKSTAR algoritmi
--------------------
Anna pisteiden lukumäärä: 7