实现代码如下:
#include<iostream>
#include<set>
#include <vector>
#include <map>
#include<queue>
#include<string.h>
using namespace std;
const int maxSize = 10010;
//vector<int> Adj[maxSize];
set<int> Adj[maxSize];
set<int>s;
bool vis[maxSize]={};
bool inq[maxSize]={};
void dfs(int s,vector<int>&vec){
vis[s]=true;
vec.push_back(s);
//cout<<' '<<s;
for(auto it=Adj[s].begin();it!=Adj[s].end();it++){
if(vis[*it]==false){
dfs(*it,vec);
}
}
// for(int i=0;i<Adj[s].size();i++){
// if(vis[Adj[s][i]]==false){
// dfs(Adj[s][i]);
// }
// }
}
void bfs(int s,vector<int>&vec){
queue<int> q;
inq[s]=true;
vec.push_back(s);
q.push(s);
while(!q.empty()){
int t=q.front();
//cout<<' '<<t;
q.pop();
for(auto it=Adj[t].begin();it!=Adj[t].end();it++){
if(inq[*it]==false){
inq[*it]=true;
vec.push_back(*it);
q.push(*it);
}
}
// for(int i=0;i<Adj[t].size();i++){
// if(inq[Adj[t][i]]==false){
// inq[Adj[t][i]]=true;
// q.push(Adj[t][i]);
// }
// }
}
}
int main()
{
vector<vector<int>>ans;
multimap<int, int> maps;
{
maps.insert(pair<int, int>(1, 2));
maps.insert(pair<int, int>(3, 4));
maps.insert(pair<int, int>(4, 1));
}
{
/*
maps.insert(pair<int, int>(1, 2));
maps.insert(pair<int, int>(2, 3));
maps.insert(pair<int, int>(2, 5));
maps.insert(pair<int, int>(4, 4));
maps.insert(pair<int, int>(6, 7));
maps.insert(pair<int, int>(6, 8));
maps.insert(pair<int, int>(8, 2));
*/
}
{
/*
maps.insert(pair<int, int>(1, 1));
maps.insert(pair<int, int>(1, 2));
maps.insert(pair<int, int>(2, 1));
maps.insert(pair<int, int>(2, 2));
maps.insert(pair<int, int>(12, 12));
maps.insert(pair<int, int>(12, 13));
maps.insert(pair<int, int>(12, 34));
maps.insert(pair<int, int>(13, 12));
maps.insert(pair<int, int>(13, 13));
maps.insert(pair<int, int>(13, 34));
maps.insert(pair<int, int>(25, 25));
maps.insert(pair<int, int>(29, 29));
maps.insert(pair<int, int>(29, 30));
maps.insert(pair<int, int>(29, 33));
maps.insert(pair<int, int>(30, 29));
maps.insert(pair<int, int>(30, 30));
maps.insert(pair<int, int>(33, 29));
maps.insert(pair<int, int>(33, 30));
maps.insert(pair<int, int>(33, 34));
maps.insert(pair<int, int>(34, 12));
maps.insert(pair<int, int>(34, 13));
maps.insert(pair<int, int>(34, 33));
maps.insert(pair<int, int>(34, 34));
*/
}
multimap<int, int>::iterator multimap_iter;
for (multimap_iter = maps.begin(); multimap_iter != maps.end(); ++multimap_iter)
{
//cout << "key:" << multimap_iter->first << " value:" << multimap_iter->second << endl;
int a, b;
a = multimap_iter->first;
b = multimap_iter->second;
Adj[a].insert(b);
Adj[b].insert(a);
// Adj[a].push_back(b);
// Adj[b].push_back(a);
s.insert(a);
s.insert(b);
}
//memset(vis,false,sizeof(vis));
memset(inq,false,sizeof(inq));
for (auto &i : s)
{
/*
if(vis[i])
continue;
vector<int>vec;
cout<<'{';
dfs(i,vec);
cout<<" }\n";
ans.push_back(vec);
*/
if(inq[i])
continue;
vector<int>vec;
//cout<<'{';
bfs(i,vec);
//cout<<" }\n";
ans.push_back(vec);
}
printf("结果为:\n");
for (int i = 0; i < ans.size(); i++)
{
printf("<");
for (int j = 0; j < ans[i].size(); j++)
{
if (j == ans[i].size() - 1)
{
printf("%d>\n", ans[i][j]);
}
else
{
printf("%d,", ans[i][j]);
}
}
}
system("pause");
return 0;
}
使用auto遍历简化代码编写:
#include<iostream>
#include<set>
#include <vector>
#include <map>
#include<queue>
#include<string.h>
using namespace std;
const int maxSize = 10010;
//vector<int> Adj[maxSize];
set<int> Adj[maxSize];
set<int>s;
bool vis[maxSize]={};
bool inq[maxSize]={};
void dfs(int s,vector<int>&vec){
vis[s]=true;
vec.push_back(s);
//cout<<' '<<s;
/*
for(auto it=Adj[s].begin();it!=Adj[s].end();it++){
if(vis[*it]==false){
dfs(*it,vec);
}
}
*/
for(auto &item: Adj[s])
{
cout<<item<<endl;
if(vis[item]==false)
{
dfs(item,vec);
}
}
// for(int i=0;i<Adj[s].size();i++){
// if(vis[Adj[s][i]]==false){
// dfs(Adj[s][i]);
// }
// }
}
void bfs(int s,vector<int>&vec){
queue<int> q;
inq[s]=true;
vec.push_back(s);
q.push(s);
while(!q.empty()){
int t=q.front();
//cout<<' '<<t;
q.pop();
/*
for(auto it=Adj[t].begin();it!=Adj[t].end();it++){
if(inq[*it]==false){
inq[*it]=true;
vec.push_back(*it);
q.push(*it);
}
}
*/
for(auto &item:Adj[t])
{
if(inq[item]==false)
{
inq[item]=true;
vec.push_back(item);
q.push(item);
}
}
// for(int i=0;i<Adj[t].size();i++){
// if(inq[Adj[t][i]]==false){
// inq[Adj[t][i]]=true;
// q.push(Adj[t][i]);
// }
// }
}
}
int main()
{
vector<vector<int>>ans;
multimap<int, int> maps;
{
/*
maps.insert(pair<int, int>(1, 2));
maps.insert(pair<int, int>(3, 4));
maps.insert(pair<int, int>(4, 1));
*/
}
{
maps.insert(pair<int, int>(1, 2));
maps.insert(pair<int, int>(2, 3));
maps.insert(pair<int, int>(2, 5));
maps.insert(pair<int, int>(4, 4));
maps.insert(pair<int, int>(6, 7));
maps.insert(pair<int, int>(6, 8));
maps.insert(pair<int, int>(8, 2));
}
{
/*
maps.insert(pair<int, int>(1, 1));
maps.insert(pair<int, int>(1, 2));
maps.insert(pair<int, int>(2, 1));
maps.insert(pair<int, int>(2, 2));
maps.insert(pair<int, int>(12, 12));
maps.insert(pair<int, int>(12, 13));
maps.insert(pair<int, int>(12, 34));
maps.insert(pair<int, int>(13, 12));
maps.insert(pair<int, int>(13, 13));
maps.insert(pair<int, int>(13, 34));
maps.insert(pair<int, int>(25, 25));
maps.insert(pair<int, int>(29, 29));
maps.insert(pair<int, int>(29, 30));
maps.insert(pair<int, int>(29, 33));
maps.insert(pair<int, int>(30, 29));
maps.insert(pair<int, int>(30, 30));
maps.insert(pair<int, int>(33, 29));
maps.insert(pair<int, int>(33, 30));
maps.insert(pair<int, int>(33, 34));
maps.insert(pair<int, int>(34, 12));
maps.insert(pair<int, int>(34, 13));
maps.insert(pair<int, int>(34, 33));
maps.insert(pair<int, int>(34, 34));
*/
}
/*
multimap<int, int>::iterator multimap_iter;
for (multimap_iter = maps.begin(); multimap_iter != maps.end(); ++multimap_iter)
{
//cout << "key:" << multimap_iter->first << " value:" << multimap_iter->second << endl;
int a, b;
a = multimap_iter->first;
b = multimap_iter->second;
Adj[a].insert(b);
Adj[b].insert(a);
// Adj[a].push_back(b);
// Adj[b].push_back(a);
s.insert(a);
s.insert(b);
}
*/
for(auto &item: maps)
{
int a, b;
a = item.first;
b = item.second;
Adj[a].insert(b);
Adj[b].insert(a);
// Adj[a].push_back(b);
// Adj[b].push_back(a);
s.insert(a);
s.insert(b);
}
//memset(vis,false,sizeof(vis));
memset(inq,false,sizeof(inq));
for (auto &i : s)
{
/*
if(vis[i])
continue;
vector<int>vec;
cout<<'{';
dfs(i,vec);
cout<<" }\n";
ans.push_back(vec);
*/
if(inq[i])
continue;
vector<int>vec;
//cout<<'{';
bfs(i,vec);
//cout<<" }\n";
ans.push_back(vec);
}
printf("结果为:\n");
for (int i = 0; i < ans.size(); i++)
{
printf("<");
for (int j = 0; j < ans[i].size(); j++)
{
if (j == ans[i].size() - 1)
{
printf("%d>\n", ans[i][j]);
}
else
{
printf("%d,", ans[i][j]);
}
}
}
system("pause");
return 0;
}
关注个人订阅号,获取更多算法技术文章: