Поиск в ширину: Wrong number of procedure parameters

visited: MassivBool;
{матрица смежности графа}
const GM: MassivInt = (
(0, 1, 1, 0),
(0, 0, 1, 1),
(1, 0, 0, 1),
(0, 1, 0, 0));
{поиск в ширину}
procedure BFS (visited: MassivBool; _unit: integer; var i:integer);
var
queue: array [1..n] of integer;
count, head: integer;
begin
for i:=1 to n do queue [i]:=0;
count:=0; head:=0;
count:=count+1;
queue [count]:=_unit;
visited[_unit]:=true;
while head<count do
begin
head:=head+1;
_unit:=queue [head];
write (_unit, ' ');
for i:=1 to n do
begin
if (GM [_unit, i] <>0) and (not visited [i]) then
begin
count:=count+1;
queue [count]:=i;
visited [i]:=true;
end;
end;
end;
end;
{основной блок программы}
begin
clrscr;
write ('Стартовая вершина >> '); read (start);
writeln ('Матрица смежности графа: ');
for i:=1 to n do
begin
visited [i]:=false;
for j:=1 to n do
write (' ', GM [i, j]);
writeln;
end;
write ('Порядок обхода: ');
BFS (start,visited);
end.

program BreadthFirstSearch;
uses crt;
const n=4;
type
MassivInt=array [1..n, 1.. n] of integer;
MassivBool=array [1..n] of boolean;
var
i, j, start: integer;
visited: MassivBool;
{матрица смежности графа}
const GM: MassivInt = (
(0, 1, 1, 0),
(0, 0, 1, 1),
(1, 0, 0, 1),
(0, 1, 0, 0));
{поиск в ширину}
procedure BFS (visited: MassivBool; _unit: integer; var i:integer);
var
queue: array [1..n] of integer;
count, head: integer;
begin
for i:=1 to n do queue [i]:=0;
count:=0; head:=0;
count:=count+1;
queue [count]:=_unit;
visited[_unit]:=true;
while head<count do
begin
head:=head+1;
_unit:=queue [head];
write (_unit, ' ');
for i:=1 to n do
begin
if (GM [_unit, i] <>0) and (not visited [i]) then
begin
count:=count+1;
queue [count]:=i;
visited [i]:=true;
end;
end;
end;
end;
{основной блок программы}
begin
clrscr;
write ('Стартовая вершина >> '); read (start);
writeln ('Матрица смежности графа: ');
for i:=1 to n do
begin
visited [i]:=false;
for j:=1 to n do
write (' ', GM [i, j]);
writeln;
end;
write ('Порядок обхода: ');
BFS (start,visited);
end.

procedure BFS (visited: MassivBool; _unit: integer; var i:integer);//3 параметра

BFS (start,visited);//уже только 2 параметра

count:=count+1;
queue [count]:=_unit;
visited[_unit]:=true;
while head<count do
begin
head:=head+1;
_unit:=queue [head];
write (_unit, ' ');
for i:=1 to n do
begin
if (GM [_unit, i] <>0) and (not visited [i]) then
begin
count:=count+1;
queue [count]:=i;
visited [i]:=true;
end;
end;
end;
end;
{основной блок программы}
begin
clrscr;
write ('Стартовая вершина >> '); read (start);
writeln ('Матрица смежности графа: ');
for i:=1 to n do
begin
visited [i]:=false;
for j:=1 to n do
write (' ', GM [i, j]);
writeln;
end;
write ('Порядок обхода: ');
BFS (start,visited);
end.

program BreadthFirstSearch;
uses crt;
const n=4;
type
MassivInt=array [1..n, 1.. n] of integer;
MassivBool=array [1..n] of boolean;
var
i, j, start: integer;
visited: MassivBool;
{матрица смежности графа}
const GM: MassivInt = (
(0, 1, 1, 0),
(0, 0, 1, 1),
(1, 0, 0, 1),
(0, 1, 0, 0));
{поиск в ширину}
procedure BFS (visited: MassivBool; _unit: integer);
var
queue: array [1..n] of integer;
var i:integer;
count, head: integer;
begin
for i:=1 to n do queue [i]:=0;
count:=0; head:=0;
count:=count+1;
queue [count]:=_unit;
visited[_unit]:=true;
while head<count do
begin
head:=head+1;
_unit:=queue [head];
write (_unit, ' ');
for i:=1 to n do
begin
if (GM [_unit, i] <>0) and (not visited [i]) then
begin
count:=count+1;
queue [count]:=i;
visited [i]:=true;
end;
end;
end;
end;
{основной блок программы}
begin
clrscr;
write ('Стартовая вершина >> '); read (start);
writeln ('Матрица смежности графа: ');
for i:=1 to n do
begin
visited [i]:=false;
for j:=1 to n do
write (' ', GM [i, j]);
writeln;
end;
write ('Порядок обхода: ');
BFS (start,visited);
end.

procedure BFS (visited: MassivBool; _unit: integer);
var
queue: array [1..n] of integer;
i,count, head: integer;