fork download
copy 
  1. program oli3_riconnessioneconbfs; (* ricerca del numero di componenti connessi su  grafo semplice risolto con lista                                di adiacenza e bfs*)
  2. const MAXN =100000;
  3.       Qsize=200000;
  4. var
  5.    N, M, ricorda, conta,contacomponenti,a ,b,j,  h: longint;
  6.    graph : array[0..MAXN-1] of array of longint;
  7.    gsize, gcapa: array[0..MAXN-1] of longint;
  8.    visited : array[0..MAXN-1] of boolean;
  9.    S,E,dist : array[0..MAXN-1] of longint;
  10.    q1, q2 : array[0..QSIZE-1] of longint;
  11.    uscita: boolean;
  12.  
  13. procedure bfs(b : longint; var res : array of longint);
  14.  var qhead, qcount, first, second, j : longint;
  15.  
  16.  begin
  17.    q1[0] := b; q2[0] := 0;
  18.    qhead := 0; qcount := 1;
  19.    while qcount > 0 do
  20.        begin
  21.          first := q1[qhead];
  22.          second := q2[qhead];
  23.          inc(qhead);
  24.          if qhead = QSIZE then
  25.          qhead := 0;
  26.          dec(qcount);
  27.          if visited[first] then
  28.          continue;
  29.          visited[first] := True; ricorda:=first;
  30.          conta:=conta+1; (*memorizza il numero di nodi visitati*)
  31.          res[first] := second;
  32.          for j:=0 to gsize[first]-1 do
  33.                  begin
  34.                  q1[(qhead + qcount) mod QSIZE] := graph[first][j];
  35.                  q2[(qhead + qcount) mod QSIZE] := second + 1;
  36.                  inc(qcount);
  37.                 end;
  38.        end;
  39.  end;
  40.  
  41.  
  42. begin
  43.    (*assign(input, 'input.txt'); reset(input);
  44.    assign(output, 'output.txt'); rewrite(output);*)
  45.    readln(N, M);
  46.   for j:=0 to M-1 do begin
  47.    for h:=0 to j do readln (S[h],E[h]);
  48.    for h:=0 to N-1 do visited[h]:=false;
  49.     for h:=0 to N-1 do
  50.    begin
  51.      setlength(graph[h], 1);
  52.      (* all’inizio, la lista di adiacenza del nodo i ha dimensione 0
  53.        * e capacita’ 1.
  54.      *)
  55.      gsize[h] := 0;
  56.      gcapa[h] := 1;
  57.      dist[h] := maxlongint;
  58.   end;
  59.  for h:=0 to j-1 do
  60.       begin
  61.        a := S[h]; b := E[h];
  62.        (* se ho esaurito i posti nella lista di adiacenza del nodo a *)
  63.        if gsize[a] = gcapa[a] then
  64.             begin
  65.               (* allora raddoppio la sua capacita’ *)
  66.               gcapa[a] := gcapa[a] shl 1;
  67.               setlength(graph[a], gcapa[a]);
  68.             end;
  69.        graph[a][gsize[a]] := b;
  70.        inc(gsize[a]);
  71.        (* se ho esaurito i posti nella lista di adiacenza del nodo b *)
  72.        if gsize[b] = gcapa[b] then
  73.             begin
  74.               (* allora raddoppio la sua capacita’ *)
  75.               gcapa[b] := gcapa[b] shl 1;
  76.               setlength(graph[b], gcapa[b]);
  77.             end;
  78.        graph[b][gsize[b]] :=a;
  79.        inc(gsize[b]);
  80.     end;
  81.    contacomponenti:=1; conta:=0; 
  82.    bfs(0,dist);
  83.    while conta<N do
  84.                     begin 
  85.                         h:=0; uscita:=false;
  86.                         contacomponenti:=contacomponenti+1;
  87.                         while (uscita=false) and (h<N) do  if visited[h]=true then h:=h+1
  88.                                                                               else begin  uscita:=true;ricorda:=h; end;
  89.                         bfs(ricorda,dist);
  90.                     end; 
  91.  writeln (contacomponenti);  end;
  92. end.
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
10 15
7 9
3 2
7 9
4 0
7 9
5 1
0 4
6 2
6 3
7 9
8 4
1 5
8 9
6 8
9 0
stdout
copy 
10
9
8
7
6
10
10
10
10
10
10
10
10
10
10
https://ideone.com/YUFTRi
language:
Pascal (fpc 3.0.4)
created:
20 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!