图及其应用(2009烟台夏令营 赵宗昌).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点开始找点，已有m个点 var j:integer; begin if (k=n)and(a[b[1],b[k]]=1) then print(1); for j:=1 to n do if (a[i,j]=1) and (visited[j]=0) then begin visited[j]:=1; b[k+1]:=j; dfs(j,k+1); visited[j]:=0; end; end; procedure main; begin fillchar(visited,sizeof(visited),0); b[1]:=1; visited[1]:=1; dfs(1,1); print(0); end; 主程序 fillchar(visited,sizeof(visited),0); b[1]:=1; visited[1]:=1; dfs(1,1); 搜索过程 procedure dfs(i,k:integer); //已找到第k个数是i，找第k+1个 var j:integer; begin if (n=k)and(check(b[1]+b[k])) then print(1); for j:=1 to n do if (visited[j]=0) and (check(i+j)) then begin visited[j]:=1; b[k+1]:=j; dfs(j,k+1); visited[j]:=0; end; end; 判读素数 function check(i:integer):boolean; var j:integer; begin for j:=2 to i-1 do if i mod j=0 then exit(false); exit(true); end; 优化：建立素数表 maxn Prime[3..2*maxn-1]: boolean 素数：true；非素数：false 筛选法建立素数表 筛选法求素数 for i:=1 to n do prime[i]:=true; prime[1]:=false; for i:=2 to trunc(sqrt(n)) do if prime[i] then begin j:=2*i; while j=n do begin prime[j]:=false; j:=j+i; end; end; //noip2001 const