zoukankan      html  css  js  c++  java
  • POJ 1523 SPF tarjan求割点

                                                                   SPF
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 7110   Accepted: 3242

    Description

    Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis, a failure of a single node, 3, in the network on the left would prevent some of the still available nodes from communicating with each other. Nodes 1 and 2 could still communicate with each other as could nodes 4 and 5, but communication between any other pairs of nodes would no longer be possible. 

    Node 3 is therefore a Single Point of Failure (SPF) for this network. Strictly, an SPF will be defined as any node that, if unavailable, would prevent at least one pair of available nodes from being able to communicate on what was previously a fully connected network. Note that the network on the right has no such node; there is no SPF in the network. At least two machines must fail before there are any pairs of available nodes which cannot communicate. 

    Input

    The input will contain the description of several networks. A network description will consist of pairs of integers, one pair per line, that identify connected nodes. Ordering of the pairs is irrelevant; 1 2 and 2 1 specify the same connection. All node numbers will range from 1 to 1000. A line containing a single zero ends the list of connected nodes. An empty network description flags the end of the input. Blank lines in the input file should be ignored.

    Output

    For each network in the input, you will output its number in the file, followed by a list of any SPF nodes that exist. 

    The first network in the file should be identified as "Network #1", the second as "Network #2", etc. For each SPF node, output a line, formatted as shown in the examples below, that identifies the node and the number of fully connected subnets that remain when that node fails. If the network has no SPF nodes, simply output the text "No SPF nodes" instead of a list of SPF nodes.

    Sample Input

    1 2
    5 4
    3 1
    3 2
    3 4
    3 5
    0
    
    1 2
    2 3
    3 4
    4 5
    5 1
    0
    
    1 2
    2 3
    3 4
    4 6
    6 3
    2 5
    5 1
    0
    
    0

    Sample Output

    Network #1
      SPF node 3 leaves 2 subnets
    
    Network #2
      No SPF nodes
    
    Network #3
      SPF node 2 leaves 2 subnets
      SPF node 3 leaves 2 subnets

    Source

    题意
       给你图,找出割点,和这个割点除去后的连通分量个数
       割点:对于连通无向图G={V,E},S={V,T}为G的一个DFS树,则结点u是G的割点当且仅当下面条件之一被满足:

    题解
       tarjan算法,找到割点,这个点 iscut[i]+1就是连通分量个数;
    代码
    #include <cstdio>
    #include <cmath>
    #include <cstring>
    #include <ctime>
    #include <iostream>
    #include <algorithm>
    #include <set>
    #include <vector>
    #include <queue>
    #include <typeinfo>
    #include <map>
    //#include<bits/stdc++.h>
    typedef long long ll;
    using namespace std;
    #define inf 10000000
    inline ll read()
    {
        ll x=0,f=1;
        char ch=getchar();
        while(ch<'0'||ch>'9')
        {
            if(ch=='-')f=-1;
            ch=getchar();
        }
        while(ch>='0'&&ch<='9')
        {
            x=x*10+ch-'0';
            ch=getchar();
        }
        return x*f;
    }
    //***************************************************************
    struct ss
    {
        int to,next;
    }e[1000001];
    int dfn[1001],n,flag,low[1001],head[1001],cnt,t,iscut[1001];
    void add(int u,int v)
    {
        e[t].to=v;
        e[t].next=head[u];
        head[u]=t++;
    }
    void init(){
     cnt=0;
     t=1;
     flag=0;
     n=0;
     memset(head,0,sizeof(head));
     memset(dfn,0,sizeof(dfn));
     memset(low,0,sizeof(low));
    }
    void tarjan(int x)
    {
        dfn[x]=low[x]=++cnt;
        for(int i=head[x];i;i=e[i].next)
        {
            if(!dfn[e[i].to])
            {
                tarjan(e[i].to);
                low[x]=min(low[x],low[e[i].to]);
                if(dfn[x]<=low[e[i].to])iscut[x]++;
            }
            else low[x]=min(low[x],dfn[e[i].to]);
        }
    }
    int main()
    {
        int a,b;
        int oo=1;
        while(scanf("%d",&a)!=EOF)
        {
            if(a==0)break;
            init();
            scanf("%d",&b);
            n=max(max(a,b),n);
            add(a,b);
            add(b,a);
            while(scanf("%d",&a)&&a)
            {
                scanf("%d",&b);
                n=max(max(a,b),n);
                add(a,b);
                add(b,a);
            }
            for(int i=1;i<=n;i++)
            {
                iscut[i]=1;
            }
            iscut[1]=0;///1为根必认定为割点
            tarjan(1);
            printf("Network #%d
    ",oo++);
            for(int i=1;i<=n;i++)
            {
                if(iscut[i]>=2){
                        flag=1;
                    printf("  SPF node %d leaves %d subnets
    ",i,iscut[i]);
                }
            }
            if(!flag){
                printf("  No SPF nodes
    ");
            }
            printf("
    ");
        }
        return 0;
    }
  • 相关阅读:
    NodeMCU快速上云集锦
    云数据库 MySQL 8.0 重磅发布,更适合企业使用场景的RDS数据库
    MySQL 8.0 技术详解
    为更强大而生的开源关系型数据库来了!阿里云RDS for MySQL 8.0 正式上线!
    阿里云CDN技术掌舵人文景:相爱相杀一路狂奔的这十年
    容器服务kubernetes federation v2实践五:多集群流量调度
    Helm V3 新版本发布
    Serverless助力AI计算:阿里云ACK Serverless/ECI发布GPU容器实例
    详解TableStore模糊查询——以订单场景为例
    洛谷P2727 01串 Stringsobits
  • 原文地址:https://www.cnblogs.com/zxhl/p/4743921.html
Copyright © 2011-2022 走看看