问题
给定一个有N个顶点和E条边的无向图,请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N−1编号。进行搜索时,假设我们总是从编号最小的顶点出发,按编号递增的顺序访问邻接点。
输入格式:
输入第1行给出2个整数N(0<N≤10)和E,分别是图的顶点数和边数。随后E行,每行给出一条边的两个端点。每行中的数字之间用1空格分隔。
输出格式:
按照"{ v1 v2 ... vk }"的格式,每行输出一个连通集。先输出DFS的结果,再输出BFS的结果。
输入样例:
8 6
0 7
0 1
2 0
4 1
2 4
3 5
输出样例:
{ 0 1 4 2 7 }
{ 3 5 }
{ 6 }
{ 0 1 2 7 4 }
{ 3 5 }
{ 6 }
解答
#include <iostream>
#include <queue>
#include <stack>
const int INFINITY = 65535;
struct ENode
{
int V1, V2;
int Weight;
ENode(int u, int v) : V1(u), V2(v), Weight(0) {}
ENode(int u, int v, int w) : V1(u), V2(v), Weight(w) {}
};
class Graph
{
public:
int Nv;
int Ne;
int G[20][20]{};
bool Status[20]{};
Graph(int n1, int n2, const int a[], int n) : Nv(n1), Ne(n2)
{
for (int i = 0, j = 0; i < n1; ++i)
{
Status[i] = false;
for (j = 0; j < n1; ++j)
G[i][j] = INFINITY;
}
for (int k = 0; k < n; k += 3)
insert(ENode{a[k], a[k + 1], a[k + 2]});
}
bool isEdge(int u, int v)
{
return G[u][v] < INFINITY;
}
void insert(const ENode &E)
{
G[E.V1][E.V2] = E.Weight;
G[E.V2][E.V1] = E.Weight;
}
void BreadthFirstSearch(int S)
{
std::queue<int> q;
Status[S] = true;
std::cout << ' ' << S;
q.push(S);
while (!q.empty())
{
int u = q.front();
q.pop();
for (int v = 0; v < Nv; ++v)
{
if (!Status[v] and isEdge(u, v))
{
Status[v] = true;
std::cout << ' ' << v;
q.push(v);
}
}
}
}
void DepthFirstSearch(int S)
{
std::stack<int> s;
Status[S] = true;
std::cout << ' ' << S;
s.push(S);
while (!s.empty())
{
int u = s.top();
int v = 0;
for (; v < Nv; ++v)
{
if (!Status[v] and isEdge(u, v))
{
Status[v] = true;
std::cout << ' ' << v;
s.push(v);
break;
}
}
if (v == Nv)
s.pop();
}
}
void BFS()
{
for (int u = 0; u < Nv; ++u)
{
if (!Status[u])
{
std::cout << '{';
BreadthFirstSearch(u);
std::cout << " }\n";
}
}
}
void DFS()
{
for (int u = 0; u < Nv; ++u)
{
if (!Status[u])
{
std::cout << '{';
DepthFirstSearch(u);
std::cout << " }\n";
}
}
}
void reset()
{
for (int i = 0; i < Nv; ++i)
{
Status[i] = false;
}
}
};
int main()
{
int N, E;
std::cin>>N>>E;
int *a = new int[3*E];
for(int i=0;i<3*E;i+=3)
{
std::cin>>a[i]>>a[i+1];
a[i+2] = 0;
}
Graph g(N, E, a, 3*E);
g.DFS();
g.reset();
g.BFS();
// std::cout << '\n';
/*
for(int i=0;i<8;++i)
{
for(int j=0;j<8;++j)
std::cout<<g.G[i][j]<<' ';
std::cout<<'\n';
}
*/
delete []a;
return 0;
}