Алгоритмы на графах / presentation / MATRIX

{ graphs by boris }
{ adjacency matrix }
{ ЇаҐ¤бв ў«Ґ­ЁҐ Ја д  ў ўЁ¤Ґ ¬ ваЁжл ᬥ¦­®бвЁ }
{ Ја д Їа®бв®©, ­Ґ ў§ўҐи ­­л© }

const
  maxn = 250;                           { ¬ Єб. Є®«-ў® ўаҐиЁ­ }

var
  { ¬ ваЁж  ᬥ¦­®бвЁ }
  { a[i, j] = true => бгйҐбвўгҐв ॡ஠i -> j }
  a: array [1..maxn, 1..maxn] of boolean;
  { Є®«-ў® ॡҐа }
  n: longint;

{init: Ё­ЁжЁ «Ё§ жЁп Ё ўў®¤ ¤ ­­ле }
procedure init;
var
  i, x, y, nn: longint;
begin
  fillchar(a, sizeof(a), false);
  assign(input, 'graph.in');
  reset(input);

  read(n);
  read(nn);

  for i := 1 to nn do
  begin
    read(x, y);
    a[x, y] := true;
    a[y, x] := true;                    { Ґб«Ё ­Ґ®аЁҐ­вЁа®ў ­­л© Ја д }
  end;
end;

{print: ЇҐз вм ¬ ваЁжл ᬥ¦­®бвЁ }
procedure print;
var
  i, j: integer;
begin
  writeln;
  writeln('number of vertex : ', n);
  writeln('adjacency matrix');
  for i := 1 to n do
  begin
    for j := 1 to n do
      write(ord(a[i, j]));
    writeln;
  end;
end;

begin
  init;
  print;
end.