poj 1523 SPF 无向图求割点

时间：2016-04-12 01:47:55 阅读：204 评论：0 收藏：0 [点我收藏+]

标签：

SPF

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

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

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<algorithm>
#include<stack>
#include<cstring>
#include<vector>
#include<list>
#include<set>
#include<map>
using namespace std;
#define ll long long
#define mod 1000000007
#define inf 999999999
int scan()
{
    int res = 0 , ch ;
    while( !( ( ch = getchar() ) >= ‘0‘ && ch <= ‘9‘ ) )
    {
        if( ch == EOF )  return 1 << 30 ;
    }
    res = ch - ‘0‘ ;
    while( ( ch = getchar() ) >= ‘0‘ && ch <= ‘9‘ )
        res = res * 10 + ( ch - ‘0‘ ) ;
    return res ;
}
int dfn[1010];
int low[1010];
int head[1010];
int ans[1010];
int visit[1010];
int index,root,son,node,jiedge;
struct is
{
    int u,v;
    int next;
}edge[1010];
void add(int x,int y)
{
    jiedge++;
    edge[jiedge].u=x;
    edge[jiedge].v=y;
    edge[jiedge].next=head[x];
    head[x]=jiedge;
    jiedge++;
    edge[jiedge].u=y;
    edge[jiedge].v=x;
    edge[jiedge].next=head[y];
    head[y]=jiedge;
}
void dfs(int u)
{
    for(int i=head[u];i;i=edge[i].next)
    {
        int v=edge[i].v;
        if(visit[v]==0)
        {
            visit[v]=1;++index;
            dfn[v]=low[v]=index;
            dfs(v);
            low[u]=min(low[u],low[v]);
            if(low[v]>=dfn[u])
            {
                if(u==root)
                son++;
                else
                ans[u]++;
            }
        }
        else
        low[u]=min(low[u],dfn[v]);
    }
}
void trajan()
{
    memset(visit,0,sizeof(visit));
    memset(ans,0,sizeof(ans));
    index=1;
    root=1;
    son=0;
    low[1]=dfn[1]=1;
    visit[1]=1;
    dfs(1);
}
int main()
{
    int u,v;
    int flag=0;
    while(scanf("%d",&u)!=EOF)
    {
        memset(head,0,sizeof(head));
        jiedge=0;
        node=0;
        if(u==0)
        break;
        scanf("%d",&v);
        node=max(node,u);
        node=max(node,v);
        add(u,v);
        while(1)
        {
            scanf("%d",&u);
            if(u==0)
            break;
            scanf("%d",&v);
            add(u,v);
            node=max(node,u);
            node=max(node,v);
        }
        trajan();
        int kk=1;
        if(flag!=0)
            printf("\n");
        printf("Network #%d\n",++flag);
        if(son>1)
        {
            kk=0;
            printf("  SPF node %d leaves %d subnets\n",1,son);
        }
        for(int i=2;i<=node;i++)
        {
            if(ans[i])
            {
                kk=0;
                printf("  SPF node %d leaves %d subnets\n",i,ans[i]+1);
            }
        }
        if(kk)
        printf("  No SPF nodes\n");
    }
    return 0;
}

View Code

poj 1523 SPF 无向图求割点

标签：

原文地址：http://www.cnblogs.com/jhz033/p/5380772.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行