① 邻接矩阵
#include<stdio.h>
const int MAXV = 1000;
const int INF = 1000000000;
int n, G[MAXV][MAXV];
bool vis[MAXV] = {
false};
void DFS(int u, int depth)
{
vis[u] = true;
for(int v = 0; v < n; v++)
{
if(vis[v] == false && G[u][v] != INF)
{
DFS(v, depth + 1);
}
}
}
void DFSTrave()
{
for(int u = 0; u < n; u++)
{
if(vis[u] == false)
{
DFS(u, 1);
}
}
}
int main()
{
return 0;
}
② 邻接表版
#include<stdio.h>
#include<vector>
const int MAXN = 1000;
int n;
vector<int> Adj[MAXN];
bool vis[MAXN] = {
false};
void DFS(int u, int depth)
{
vis[u] = true;
for(int i = 0; i < Adj[u].size(); i++)
{
int v = Adj[u][i];
if(vis[v] == false) DFS(v, depth + 1);
}
}
void DFSTrave()
{
for(int u = 0; u < n; u++)
{
if(vis[u] == false) DFS(u, 1);
}
}
int main()
{
return 0;
}
#include<iostream>
#include<stdio.h>
#include<string>
#include<map>
using namespace std;
const int maxn = 2010;
const int INF = 1000000000;
map<int, string> intTostring;
map<string, int> stringToint;
map<string, int> Gang;
int G[maxn][maxn] = {
0}, weight[maxn] = {
0};
int n, k, numPerson = 0;
bool vis[maxn] = {
false};
int change(string str)
{
if(stringToint.find(str) != stringToint.end()) return stringToint[str];
else{
stringToint[str] = numPerson;
intTostring[numPerson] = str;
return numPerson++;
}
}
void DFS(int nowVisit, int &head, int &numMember, int &totalValue)
{
numMember++;
vis[nowVisit] = true;
if(weight[nowVisit] > weight[head]) head = nowVisit;
for(int i = 0; i < numPerson; i++)
{
if(G[nowVisit][i] > 0)
{
totalValue += G[nowVisit][i];
G[nowVisit][i] = 0;
G[i][nowVisit] = 0;
if(vis[i] == false)
{
DFS(i, head, numMember, totalValue);
}
}
}
}
void DFSTrave()
{
for(int i = 0; i < numPerson; i++)
{
if(vis[i] == false)
{
int head = i, numMember = 0, totalValue = 0;
DFS(i, head, numMember, totalValue);
if(numMember > 2 && totalValue > k)
{
Gang[intTostring[head]] = numMember;
}
}
}
}
int main()
{
int w;
string str1, str2;
cin >> n >> k;
for(int i = 0; i < n; i++)
{
cin >> str1 >> str2 >> w;
int id1 = change(str1);
int id2 = change(str2);
weight[id1] += w;
weight[id2] += w;
G[id1][id2] += w;
G[id2][id1] += w;
}
DFSTrave();
cout << Gang.size() << endl;
map<string, int>::iterator it;
for(it = Gang.begin(); it != Gang.end(); it++)
{
cout<<it->first<<" "<<it->second<<endl;
}
return 0;
}