bfs

const
  sz = 1000;

var
  g:array[0..sz,0..sz] of longint;
  q:array[0..sz] of longint;
  used:array[0..sz] of boolean;
  i,j,n,m,s,e:longint;

procedure bfs(v:longint);
var nv:longint;
begin
  fillchar(used,sizeof(used),false);
  s:=0; e:=0; q[0]:=v;
  while (s <= e) do
    begin
      nv:=q[s];
      for i:=1 to n do
        if (g[nv][i] = 1) and (not used[i]) then
          begin
            inc(e);
            q[e]:=i;
            used[i]:=true;
          end;
      inc(s);
    end;
end;

begin
end.