06-图3 六度空间
来自:PTA_数据结构_六度空间
“六度空间”理论又称作“六度分隔(Six Degrees of Separation)”理论。这个理论可以通俗地阐述为:“你和任何一个陌生人之间所间隔的人不会超过六个,也就是说,最多通过五个人你就能够认识任何一个陌生人。”如图1所示。
“六度空间”理论虽然得到广泛的认同,并且正在得到越来越多的应用。但是数十年来,试图验证这个理论始终是许多社会学家努力追求的目标。然而由于历史的原因,这样的研究具有太大的局限性和困难。随着当代人的联络主要依赖于电话、短信、微信以及因特网上即时通信等工具,能够体现社交网络关系的一手数据已经逐渐使得“六度空间”理论的验证成为可能。
假如给你一个社交网络图,请你对每个节点计算符合“六度空间”理论的结点占结点总数的百分比。
输入格式:
输入第1行给出两个正整数,分别表示社交网络图的结点数N(1<N≤10^3,表示人数)、边数M(≤33×N,表示社交关系数)。随后的M行对应M条边,每行给出一对正整数,分别是该条边直接连通的两个结点的编号(节点从1到N编号)。
输出格式:
对每个结点输出与该结点距离不超过6的结点数占结点总数的百分比,精确到小数点后2位。每个结节点输出一行,格式为“结点编号:(空格)百分比%”。
输入样例:
10 9
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
输出样例:
1: 70.00%
2: 80.00%
3: 90.00%
4: 100.00%
5: 100.00%
6: 100.00%
7: 100.00%
8: 90.00%
9: 80.00%
10: 70.00%
参考代码:
#include<stdio.h>
#include<stdlib.h>
/*边的定义*/
typedef struct Enode* Edge;
struct Enode {
int V1, V2;
};
/*邻接点的定义*/
typedef struct Adjvnode* prttoadjvnode;
struct Adjvnode {
int adjv;
prttoadjvnode next;
};
/*顶点定义*/
typedef struct Vnode {
prttoadjvnode firstedge;
}adjlist[10001];
/*图节点定义*/
struct Gnode {
int Nv;/*顶点数*/
int Ne;/*边数*/
adjlist G ; /*邻接表*/
};
typedef struct Gnode* Lgraph;
/*队列*/
typedef struct Qnode* ptrtoQnode;
struct Qnode {
int* Data;/*data数组,*/
int front, rear;/*队列头尾指针*/
int maxsize;/*容量*/
};
typedef ptrtoQnode Queue;
/*图的操作*/
Lgraph creatgraph(int size);
void insertedge(Lgraph graph, Edge E);
Lgraph buildgraph(int N);
/*队列操作*/
int AddQ(Queue Q, int x);
Queue CreateQueue(int maxsize);
int isempty(Queue Q);
int DeleteQ(Queue Q);
int SBS_BST(Lgraph graph, int s, int N, int* visited);
void six(Lgraph graph, int* visited, int N);
int main() {
int N;/*顶点数*/
scanf("%d", &N);
//N = N+1; /*把N+1*/ /*其实也可以不用+1,尝试着改一下*/
Lgraph graph = buildgraph(N);
int* visited = (int*)malloc((N + 1) * sizeof(int));
for (int i = 1; i <= N; i++) {
visited[i] = 0;
}
six(graph, visited, N);
return 0;
}
Lgraph creatgraph(int size) {
Lgraph graph = (Lgraph)malloc(sizeof(struct Gnode));
graph->Nv = size;
graph->Ne = 0;
for (int i = 1; i <= size; i++) {
graph->G[i].firstedge = NULL;
}
return graph;
}
void insertedge(Lgraph graph, Edge E) {
/*v1,v2*/
prttoadjvnode newnode = (prttoadjvnode)malloc(sizeof(struct Adjvnode));
newnode->adjv = E->V2;
newnode->next = graph->G[E->V1].firstedge;
graph->G[E->V1].firstedge = newnode;
prttoadjvnode newnode1 = (prttoadjvnode)malloc(sizeof(struct Adjvnode));
newnode1->adjv = E->V1;
newnode1->next = graph->G[E->V2].firstedge;
graph->G[E->V2].firstedge = newnode1;
}
Lgraph buildgraph(int N) {
Lgraph graph;
graph = creatgraph(N);
scanf("%d", &graph->Ne);
if (graph->Ne != 0) {
Edge E = (Edge)malloc(sizeof(struct Enode));
for (int i = 0; i < graph->Ne; i++) {
scanf("%d %d", &E->V1, &E->V2);
insertedge(graph, E);
}
}
return graph;
}
Queue CreateQueue(int maxsize) {
Queue Q = (Queue)malloc(sizeof(struct Qnode));
Q->Data = (int*)malloc(maxsize * sizeof(int));
Q->front = Q->rear = 0;
Q->maxsize = maxsize;
return Q;
}
int AddQ(Queue Q, int x) {
Q->rear = (Q->rear + 1); //这里搞了个循环队列存储,不过根本没必要,因为下边给的队列空间足够大。
Q->Data[Q->rear] = x;
return 1;
}
int isempty(Queue Q) {
return(Q->rear == Q->front);
}
int DeleteQ(Queue Q) {
Q->front = (Q->front + 1);
return Q->Data[Q->front];
}
int SBS_BST(Lgraph graph, int s,int N,int * visited) { /*以s为出发点对图进行6层BFS*/
Queue Q;
Q = CreateQueue(N);
int count;
int level;
int v, last, tail;
prttoadjvnode w;
visited[s] = 1;
count = 1;
level = 0; /*起始点定义为第0层*/
last = s;
AddQ(Q, s);
while (isempty(Q) != 1) {
v = DeleteQ(Q);
for (w = graph->G[v].firstedge; w; w = w->next) { /*访问v的每个邻接点*/
if (visited[w->adjv] == 0) {
visited[w->adjv] = 1;
count++;
tail = w->adjv;
AddQ(Q, w->adjv);
}
}
if (last == v)
{
level++;
last = tail;
}
if (level == 6)break;
}
return count;
}
void six(Lgraph graph,int *visited,int N) {
int v;
int count;
for (v = 1; v <= graph->Nv; v++) {
count = SBS_BST(graph, v, N, visited);
printf("%d: %.2f%%\n", v, 100.0 * (double)count / (double)(graph->Nv));/*由于前面改了N的实际大小,所以此处要改回来*/
for (int i = 1; i <= N; i++) {
visited[i] = 0;
}
}
}