Добавил:
Studfiles2
Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз:
Предмет:
Файл:Алгоритмы на графах / dfs / path
.pas{ graphs by boris }
{ depth-first search (path) }
const
maxn = 250;
var
a: array [1..maxn, 1..maxn] of boolean;
visited: array [1..maxn] of boolean;
p: array [1..maxn] of word;
n: longint;
procedure init;
var
i, x, y, nn: longint;
begin
fillchar(a, sizeof(a), false);
fillchar(p, sizeof(p), false);
fillchar(visited, sizeof(visited), 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;
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;
procedure dfs(v: longint);
var
i: integer;
begin
visited[v] := true;
for i := 1 to n do
if (not visited[i]) and a[v, i] then
begin
p[i] := v;
dfs(i);
end;
end;
procedure print_path(v, w: word);
procedure path(w: word);
begin
if w <> v then
path(p[w]);
write(w, ' ');
end;
begin
path(w);
writeln;
end;
var
i: longint;
begin
init;
writeln('depth-first search (path)');
for i := 1 to n do
if not visited[i] then
dfs(i);
write('path from 1 to 6 : ');
print_path(1, 6);
print;
end.