-
Notifications
You must be signed in to change notification settings - Fork 0
/
module2.h
145 lines (122 loc) · 3.12 KB
/
module2.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
//only for undirectedgraph i guess
#include<list>
#include "Graph.h"
void bfs(Graph G)
{
int visit[G.vertex_count+1]={0};
int bfsnow[G.vertex_count +1];
int bfs_size=0;
list<int> queue;
int flag;
for(int l=1;l<=G.vertex_count;l++)
{
if(visit[l]==0)
flag=1;
else
flag=0;
if(flag==1)
{
visit[l]=1;
queue.push_back(l);
// cout<<endl<<l<<endl;
while (!queue.empty())
{
int s=queue.front();
bfsnow[bfs_size++]=s;
// cout<<s;
queue.pop_front();
struct edgelist *temp=G.edges[s];
while(temp!=NULL)
{
int k=temp->value;
if(visit[k]==0)
{
visit[k]=1;
queue.push_back(k);
}
temp=temp->next;
}
}
}
}
cout<<endl<<"bfs"<<endl;
for(int i=0;i<bfs_size;i++)
cout<<" "<<bfsnow[i]<<" ";
}
void bfs(Graph G,int start)
{
int visit[G.vertex_count+1]={0};
int bfsnow[G.vertex_count +1];
int bfs_size=0;
list<int> queue;
visit[start]=1;
queue.push_back(start);
while (!queue.empty())
{
int s=queue.front();
bfsnow[bfs_size++]=s;
queue.pop_front();
struct edgelist *temp=G.edges[s];
while(temp!=NULL)
{
int k=temp->value;
if(visit[k]==0)
{
visit[k]=1;
queue.push_back(k);
}
temp=temp->next;
}
}
cout<<endl<<"bfs"<<endl;
for(int i=0;i<bfs_size;i++)
cout<<" "<<bfsnow[i]<<" ";
}
void bfs(Graph G,int start,int end)
{
int visit[G.vertex_count+1]={0};
int bfsnow[G.vertex_count +1];
int bfs_size=0;
list<int> queue;
visit[start]=1;
queue.push_back(start);
while (!queue.empty())
{
int s=queue.front();
bfsnow[bfs_size++]=s;
if(s==end)
break;
queue.pop_front();
struct edgelist *temp=G.edges[s];
while(temp!=NULL)
{
int k=temp->value;
if(visit[k]==0)
{
visit[k]=1;
queue.push_back(k);
}
temp=temp->next;
}
}
int flag;
for(int i=0;i<bfs_size;i++)
if(bfsnow[i]==end)
flag=1;
else
flag=0;
if(flag==0)
cout<<endl<<end<<" not reachable from "<<start<<"using bfs"<<endl;
else
{
cout<<endl<<end<<" reachable from "<<start<<"using bfs"<<endl<<"path :";
for(int k=0;k<bfs_size;k++)
{
cout<<" "<<bfsnow[k]<<" ";
if(bfsnow[k]==end)
break;
}
}
}
/*
*/