-
Notifications
You must be signed in to change notification settings - Fork 0
/
Graph.cpp
90 lines (76 loc) · 1.5 KB
/
Graph.cpp
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
#include "Graph.h"
#include "FiFo.h"
Graph::Graph(int pV)
{
aV = pV;
Adj_L = new list<int>[aV];
}
void Graph::addEdge(int v, int w)
{
Adj_L[v].push_back(w);
}
void Graph::show(void)
{
for (int i = 0; i < aV; i++)
{
cout << "Vertex " << i << "->";
for (int neighbor : Adj_L[i])
{
cout << neighbor << ",";
}
cout << endl;
}
}
list<int> Graph::BFS(int pS, int pE)
{
int start = pS;
//Crear cola
CFiFo<int> queue = CFiFo<int>(1, 1);
//Comenzar con todos los nodos sin visitar
bool* visited = new bool[aV];
for (int i = 0; i < aV; i++)
{
visited[i] = false;
}
//Marcar visitado el punto de inicio
visited[pS] = true;
queue.push(pS);
//Prev
int* prev = new int[aV];
for (int i = 0; i < aV; i++)
{
prev[i] = -1;
}
//Loop mientras la cola tenga valores
while (!queue.isEmpty())
{
//nodo actual = el que sigue en la cola
pS = queue.front();
queue.pop();
cout << "Revisando nodos adyacentes al nodo " << pS << endl;
for (auto i = Adj_L[pS].begin(); i != Adj_L[pS].end(); i++)
{
//Ignorarlo si ya ha sido visitad
if (!visited[*i])
{
//Marcarlo como ya visitado
cout << "Visitando nodo " << *i << endl;
visited[*i] = true;
//Mandarlo a la cola
queue.push(*i);
prev[*i] = pS;
}
}
}
list<int> path;
for(int at = pE; at != -1; at = prev[at])
{
path.push_front(at);
}
path.reverse();
if (path.front() == start)
{
return(path);
}
return(path);
}