这两天一直在做交流,没怎么写代码,很可惜啊。
从今天开始用英语写注释了,英语确实是很重要(英语渣表示
solve the first question on stack overflow(捂脸
实例6.1 六度空间 (30 分) “六度空间”理论又称作“六度分隔(Six Degrees of
Separation)”理论。这个理论可以通俗地阐述为:“你和任何一个陌生人之间所间隔的人不会超过六个,也就是说,最多通过五个人你就能够认识任何一个陌生人。”如图1所示。图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%
刚开始写思路太麻烦了,说到底还是算法拖了后腿
Wrong code:
#include <stdio.h>
#include<stdlib.h>
#include <cstring>
#include <iostream>
#include <cstdio>
#include<cstdlib>
#include<cmath>
#include <iomanip>
using namespace std;
#define MaxSize 1000
//Queue
typedef struct FNode* Queue;
struct FNode {
int* data;
int rear, front;
int maxsize;
};
Queue CreatQueue(int maxsize) {
Queue Q = (Queue)malloc(sizeof(struct FNode));
Q->data= (int*)malloc(sizeof(int) * maxsize);
Q->front = Q->rear = 0;
Q->maxsize = maxsize;
return Q;
}
void insertQueue(Queue Q,int a) {
Q->front++;
Q->data[Q->front] = a;
}
int deleteQueue(Queue Q) {
Q->rear++;
return Q->data[Q->rear];
}
int ISEmpty_Queue(Queue Q) {
return Q->front == Q->rear;
}
//Adjacency List achieve Graph
typedef struct SNode* PtrNode;
struct SNode {
int data;
PtrNode Next;
};
//Head Node
/*struct HNode {
PtrNode Next;
};*/
typedef PtrNode HNode;
typedef struct GNode* MGraph;
struct GNode {
int Nv;
int Ne;
PtrNode FirstNode[MaxSize];
};
MGraph initilalization_Graph(int Nv,int Ne) {
MGraph G=(MGraph) malloc(sizeof (struct GNode) );
G->Ne = Ne;
G->Nv = Nv;
int edge1, edge2;
for (int i = 0; i <= Nv; i++) {
G->FirstNode[i] = (PtrNode)malloc(sizeof(struct SNode));
G->FirstNode[i]->Next = NULL;
G->FirstNode[i]->data = i;
}
while (Ne--) {
cin >> edge1 >> edge2;
PtrNode NewNode=(PtrNode)malloc(sizeof(struct SNode));
NewNode->data = edge2;
NewNode->Next = G->FirstNode[edge1]->Next;
G->FirstNode[edge1]->Next = NewNode;
PtrNode NewNode2 = (PtrNode)malloc(sizeof(struct SNode));
NewNode2->data = edge1;
NewNode2->Next = G->FirstNode[edge2]->Next;
G->FirstNode[edge2]->Next = NewNode2;
}
return G;
}
//BFS,recording the last node of the floor,remember don't change the data of Graph
void BFS(MGraph G,int first) {
int trave[MaxSize] = { 0 };
int last=0,tmp;//store the layers of traversal
int sum = 1;//store the number of meet six degrees of separation
int* jud = (int*)malloc(sizeof(int) * G->Nv);
for (int i = 1; i <= G->Nv; i++)
jud[i] = 0;//whether be treversed
Queue Q = CreatQueue(G->Nv);
insertQueue(Q, first);
PtrNode markNode = (PtrNode)malloc(sizeof(struct SNode));//marknode star at the last node of the floor's last node
markNode = G->FirstNode[first]->Next;
if (markNode == NULL) {//this people don't know anyone
cout << "first:" << setprecision(2) << (double)(sum / G->Nv) << "%" << endl;
return;
}
else while (markNode->Next != NULL)
markNode = markNode->Next;
while (last != 6||ISEmpty_Queue(Q)) {
tmp = deleteQueue(Q);
trave[tmp] = 1;
PtrNode judNode ;
judNode = G->FirstNode[tmp];//judment node star at the next floor
PtrNode tmpNode = (PtrNode)malloc(sizeof(struct SNode));//as a sentinel to help marknode updateits data
tmpNode = judNode;
while (tmpNode->Next != NULL ) {
if (!trave[tmpNode->Next->data]) {
judNode = tmpNode->Next;
insertQueue(Q, judNode->data);
sum++;
}
tmpNode = tmpNode->Next;
}
if (judNode == markNode) {//traversal the last node of this floor
last++;
markNode=G->FirstNode[markNode->data];
tmpNode = markNode;
while (tmpNode->Next != NULL ) {
if (!trave[tmpNode->Next->data]) {
markNode = tmpNode->Next;
}
tmpNode = tmpNode->Next;//update markNode
}
}
}
cout << first<<":" <<fixed<< setprecision(2) << (double)(100*(double)sum / (double)G->Nv) << "%" << endl;
}
void printf_Graph(MGraph G) {
for (int i = 1; i <= G->Nv; i++)
BFS(G, i);
}
int main() {
int Nv, Ne;
cin >> Nv >> Ne;
MGraph G=initilalization_Graph(Nv, Ne);
printf_Graph(G);
return 0;
}
</textarea>
写和denug加起来得六个小时,但还是没通过,放弃之
查google 学会了一个用法:
cout <<fixed<< setprecision(num)可以控制小数点位数
借鉴其它博主经验AC
下面这个确实思路巧妙清晰,值得学习
我现在还只会按图索骥,非得用堆栈啦、队列啦原来书上的模板一笔一划地套用,结果就是结构很复杂,实现很困难,以后要学会灵活应用。
AC代码如下:
#include<cstdio>
#include<stdlib.h>
#include<math.h>
#define MAXN 10001
//建立图
int G[MAXN][MAXN] = { 0 }, n, m;//n是节点数,m是边数
int visited[MAXN] = { 0 };//初始化的访问列表
void isinvisited();
int BFS(int v);
int main()
{
//freopen("test.txt", "r", stdin);
int i, v1, v2;//注意节点从1到N编号,图是从0开始的
scanf_s("%d %d", &n, &m);
for (i = 0; i < m; i++)
{
scanf_s("%d %d", &v1, &v2);
v1--;
v2--;
G[v1][v2] = 1;
G[v2][v1] = 1;
}
int v;
int count;
double ratio;
for (v = 0; v < n; v++)
{
isinvisited();
count = BFS(v);
ratio = count * 1.0 / n * 100;
printf_s("%d: %.2lf%%\n", v + 1, ratio);//%%才能输出百分号
}
return 0;
}
void isinvisited()
{
int i;
for (i = 0; i < n; i++) {
visited[i] = 0;
}
}
int BFS(int v)
{
//顺序队列
const int MAXNUM = 10002;
int queue[MAXNUM];
int first = -1, rear = -1;
int count, level, last, tail;
visited[v] = true;
count = 1;//这个节点有多少人
level = 0;//层数
last = v;//这一层访问的最后一个节点
queue[++rear] = v;//入队
while (first < rear) //队列不为空
{
int de = queue[++first];//出队
for (int i = 0; i < n; i++)
{
if (G[de][i] && !visited[i])
{
visited[i] = true;
queue[++rear] = i;
count++;
tail = i;
}
}
if (de == last)
{
level++;
last = tail;
}
if (level == 6)
{
break;
}
}
return count;
}
//版权声明:本文为博主原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。
本文链接:https://blog.csdn.net/clannadandaria/article/details/51209593
————————————————
版权声明:本文为CSDN博主「clannadandaria」的原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接及本声明。
原文链接:https://blog.csdn.net/clannadandaria/article/details/51209593