Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Update BFS.cpp #777

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
Max-CoderBoi wants to merge 1 commit into codemistic:main from Max-CoderBoi:patch-13
Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
85 changes: 43 additions & 42 deletions BFS in C++/BFS.cpp
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -1,63 +1,64 @@
#include <iostream>
#include <list>
#include <vector>

using namespace std;

class Graph {
int numVertices;
list<int>* adjLists;
bool* visited;

public:
Graph(int vertices);
void addEdge(int src, int dest);
void BFS(int startVertex);
int numVertices;
list<int>* adjLists;

public:
Graph(int vertices);
~Graph(); // Destructor to free memory
void addEdge(int src, int dest);
void BFS(int startVertex);
};

Graph::Graph(int vertices) {
numVertices = vertices;
adjLists = new list<int>[vertices];
numVertices = vertices;
adjLists = new list<int>[vertices];
}

Graph::~Graph() {
delete[] adjLists; // Free allocated memory
}

void Graph::addEdge(int src, int dest) {
adjLists[src].push_back(dest);
adjLists[dest].push_back(src);
adjLists[src].push_back(dest);
adjLists[dest].push_back(src);
}

void Graph::BFS(int startVertex) {
visited = new bool[numVertices];
for (int i = 0; i < numVertices; i++)
visited[i] = false;
vector<bool> visited(numVertices, false); // Avoids memory leaks

list<int> queue;
list<int> queue;
visited[startVertex] = true;
queue.push_back(startVertex);

visited[startVertex] = true;
queue.push_back(startVertex);
while (!queue.empty()) {
int currVertex = queue.front();
cout << "Visited " << currVertex << " ";
queue.pop_front();

list<int>::iterator i;

while (!queue.empty()) {
int currVertex = queue.front();
cout << "Visited " << currVertex << " ";
queue.pop_front();

for (i = adjLists[currVertex].begin(); i != adjLists[currVertex].end(); ++i) {
int adjVertex = *i;
if (!visited[adjVertex]) {
visited[adjVertex] = true;
queue.push_back(adjVertex);
}
for (int adjVertex : adjLists[currVertex]) {
if (!visited[adjVertex]) {
visited[adjVertex] = true;
queue.push_back(adjVertex);
}
}
}
}
cout << endl;
}

int main() {
Graph g(4);
g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 2);
g.addEdge(2, 0);
g.addEdge(2, 3);
g.addEdge(3, 3);
g.BFS(2);
return 0;
}
Graph g(4);
g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 2);
g.addEdge(2, 3);
g.addEdge(3, 3);

g.BFS(2);
return 0;
}

AltStyle によって変換されたページ (->オリジナル) /