图及其应用1.ppt

邻接矩阵：代码书写简单，找邻接点慢 邻接表：代码书写较复杂，找邻接点快 稀疏图：边表 type node=record w:integer; //边权 u,v:integer; //两个结点 end; var e: array[1..maxn*(maxn-1) div 2] of node; //边 求无向的连通分量 sum:=0; for i:=1 to n do if not f[i] then begin inc(sum); dfs(i); end; writeln(sum); readln(n); for i:=1 to n do begin read(k); for j:=1 to k do begin read(x); a[i,x]:=1;a[x,i]:=1; end; end; procedure dfs(i,k:integer);//从i点开