Networking(prim)

简介: Networking(prim)

题目链接

22NYIST最小生成树专题 [Cloned] - Virtual Judge (csgrandeur.cn)


一些话

输出结果全为0,检查了数据正常读入后,发现初始化数组把st写成了dist,导致全变0

流程

读题找n,m和边,再套模板


套路


ac代码

#include <iostream>
#include <cstring>
using namespace std;
const int N = 110;
int g[N][N],dist[N];
bool st[N];
int n,m;
int prim(){
    memset(dist,0x3f,sizeof dist);
    memset(st,false,sizeof st);//输出结果全为0,检查了数据正常读入后,发现此处初始化数组写成了dist,导致全变0
    int res = 0;
    for(int i = 0;i < n;i++){
        int t = -1;
        for(int j = 1;j <= n;j++){
            if(!st[j] && (t == -1 || dist[j] < dist[t])) t = j;
        }
        if(i) res += dist[t];
        st[t] = true;
        for(int j = 1;j <= n;j++){
            dist[j] = min(dist[j],g[t][j]);
        }
    }
    return res;
}
int main(){
    while(cin >> n && n){
        memset(g,0x3f,sizeof g);
        cin >> m;
        for(int i = 1;i <= m;i++){
            int a,b,w;
            cin >> a >> b >> w;
            g[a][b] = g[b][a] = min(g[a][b],w);
            // cout << a << " " << b <<  ' ' << g[a][b] << endl;            
        }
        int t = prim();
        cout << t << endl;
    }
    return 0;
}
目录
相关文章
LeetCode 90. Subsets II
Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).
79 0
LeetCode 90. Subsets II
|
存储 算法
Prim
复习acwing算法基础课的内容,本篇为讲解基础算法:Prim,关于时间复杂度:目前博主不太会计算,先鸽了,日后一定补上。
143 0
Prim
[POJ 1236] Network of Schools | Tarjan缩点
Description A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools to which it distributes software (the “receiving schools”).
135 0
[POJ 1236] Network of Schools | Tarjan缩点
|
算法 数据建模
【POJ 1236 Network of Schools】强联通分量问题 Tarjan算法,缩点
题目链接:http://poj.org/problem?id=1236 题意:给定一个表示n所学校网络连通关系的有向图。现要通过网络分发软件,规则是:若顶点u,v存在通路,发给u,则v可以通过网络从u接收到。
1182 0
|
Java
Subsets
给定一个int数组,找出所有的子集;结果要排好序 Given a set of distinct integers, nums, return all possible subsets. Note: Elements in a subset must be in non-descending order.
594 0
|
Python
[LeetCode] Subsets
Recursive (Backtracking) This is a typical problem that can be tackled by backtracking. Since backtracking has a more-or-less similar template, so I do not give explanations for this method.
779 0