NOTASI ALGORITMIK
Program hitungweight;
KAMUS
i : integer
a: integer
ALGORITMA
Input x
while (i <= G) do
Input xv
Input e
Output e
While (a <= z) do
Input xv
Jum Jum + e
program hitungweight;
uses wincrt;
var
{ KAMUS }
i : integer;
a : integer;
begin
{ ALGORITMA }
readln (x);
z := x - 1; { Rumus mencari banyak Edge dlm Spaning
Tree }
writeln;
i := 1; { First Element }
while (i <= G) do
begin
readln (xv);
readln (e);
begin
writeln;
end;
begin
while (a <= z) do
begin
writeln;
readln (xv);
Jum := Jum + e;
end;
end;
end;
writeln;
end.
3. SCREENSHOT SCRIPT
4. SCREENSHOT PROGRAM