六度空间理论可以通俗的理解为:你和任何一个陌生人的间隔不会超过六个(如图),那么这个实验主要用于在图中搜索距离某个结点距离不超过6的结点个数
其中广度优先搜索的算法我推荐去这个老师这里学习一下深度优先和广度优先搜索_哔哩哔哩_bilibili
运行示例(我这里输出的是距离不超过6的结点个数所占比例)
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<windows.h>
#include<stdlib.h>
#include<string.h>
#define max 100
void buildgraph(int graph[][100],int j)
{
int n,m;
printf("请输入相连的两个节点\n");
while(j>0)
{
scanf("%d %d",&n,&m); //构造领接矩阵
graph[n][m] = 1;
graph[m][n] = 1;
j--;
}
}
int BFS(int *visited,int graph[][100],int k,int l)
{
int level = 0,count = 1,front = 0,rear = 0,n;
int que[max];
que[rear] = k;
rear++;
int tail,last = k; //广度优先搜索
while(front<rear)
{
n = que[front];
front++;
for(int i = 0;i<l;i++)
{
if(visited[i]==0&&graph[n+1][i+1]==1)
{
visited[i] = 1;
que[rear] = i;
count++;
rear++;
tail = i;
}
}
if(n==last)
{
level++;
last = tail;
}
if(level==6)
break;
}
return count;
}
void main()
{
int i,j;
printf("请输入节点数和边数\n");
scanf("%d %d",&i,&j);
int graph[max][max] = {0};
buildgraph(graph,j);
int n, m;
float rate;
int visited[max];
for(int k = 0;k<i;k++)
{
for(int l = 0;l<i;l++)
{
visited[l] = 0;
}
rate = (float)BFS(visited,graph,k,i)/i;
printf("%d: %.2f%%",k+1,(rate-0.1)*100);
printf("\n");
}
system("pause");
}