最小生成树prim+kruskal模板

最新推荐文章于 2023-10-13 13:42:36 发布

Jacky35

最新推荐文章于 2023-10-13 13:42:36 发布

阅读量455

点赞数 1

分类专栏：模板库最小生成树模板库文章标签： kruskal prim

本文链接：https://blog.csdn.net/u011056504/article/details/51397679

版权

模板库同时被 3 个专栏收录

43 篇文章 0 订阅

订阅专栏

模板库

39 篇文章 6 订阅

订阅专栏

最小生成树

7 篇文章 0 订阅

订阅专栏

prim

var
    a:array[1..10000,1..3] of longint;
    b:array[1..100,1..100] of longint;
    t:array[1..3] of longint;
    i,j,min,mij,ans,n,k:longint;
begin
    ans:=0;
    read(n);
    for i:=1 to n do
    for j:=1 to n do
    read(b[i,j]);
    for i:=1 to n-1 do
    begin
        a[i,1]:=1;
        a[i,2]:=i+1;
        a[i,3]:=b[1,i+1];
    end;
    for i:=1 to n-1 do
    begin
        min:=maxlongint;
        for j:=i to n-1 do
        begin
            if a[j,3]<min then begin min:=a[j,3]; mij:=j; end;
        end;
        if mij<>i then begin t:=a[i]; a[i]:=a[mij]; a[mij]:=t; end;
        k:=a[i,2];
        for j:=i+1 to n-1 do
        begin
            if b[a[j,2],k]<a[j,3] then begin a[j,3]:=b[a[j,2],k]; a[j,1]:=k; end;
        end;
        ans:=ans+a[i,3];
    end;
    writeln(ans);
end.

kruskal

var
    fa:array[1..100] of longint;
    a:array[1..100000,1..3] of longint;
    i,j,k,n,x,y,z,ans:longint;

function getfather(z:longint):longint;
begin
    if fa[z]=0 then getfather:=z
    else
    begin
        fa[z]:=getfather(fa[z]);
        getfather:=fa[z];
    end;
end;

procedure bj(z,b:longint);
begin
    z:=getfather(z);
    b:=getfather(b);
    if z<>b then fa[z]:=b;
end;


procedure dg(i,j:longint);
var
    l,r,m:longint;
    t:Array[1..3] of longint;
begin
    l:=i;
    r:=j;
    m:=a[i,3];
    repeat
        while a[j,3]>m do  j:=j-1;
        while a[i,3]<m do  i:=i+1;
        if j>=i then
                begin
                    t:=a[i];
                    a[i]:=a[j];
                    a[j]:=t;
                    j:=j-1;
                    i:=i+1;
                end;
    until i>j;
    if l<j then dg(l,j);
    if i<r then dg(i,r);
end;

begin
    assign(input,'kruskal.in'); reset(input);
    assign(output,'kruskal.out'); rewrite(output);
    read(n);
    k:=1;
    for i:=1 to n do
    for j:=1 to n do
    begin
        if i<j then
        begin
            a[k,1]:=i;
            a[k,2]:=j;
            read(a[k,3]);
            inc(k)
        end
        else read(z);
    end;
    ans:=0;
    dec(k);
    dg(1,k);
    for i:=1 to k do
    begin
        x:=getfather(a[i,1]);
        y:=getfather(a[i,2]);
        if x<>y then
        begin
            ans:=ans+a[i,3];
            bj(a[i,1],a[i,2]);
        end;
    end;
    writeln(ans);
    close(input); close(output);
end.