backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-03 18:50:56 +08:00
Code Issues Projects Releases Wiki Activity

Fix linter warnings in fixgraph branch.

Browse Source
This commit is contained in:
Filip Hlásek
2020-08-01 22:55:50 -07:00
parent c107f99db9
commit e2f344c498
8 changed files with 92 additions and 131 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
graph/bfs.cpp
View File

@@ -91,7 +91,7 @@ std::vector<int> beadth_first_search(const std::vector<std::vector<int>> &adj,
std::vector<int> result;
/// vector to keep track of visited vertices
std::vector<bool> visited(vertices, 0);
std::vector<bool> visited(vertices, false);
std::queue<int> tracker;
/// marking the start vertex as visited
@@ -172,7 +172,7 @@ int main() {
/// running predefined test cases
tests();
size_t vertices, edges;
size_t vertices = 0, edges = 0;
std::cout << "Enter the number of vertices : ";
std::cin >> vertices;
std::cout << "Enter the number of edges : ";
@@ -185,7 +185,7 @@ int main() {
std::cout << "Enter vertices in pair which have edges between them : "
<< std::endl;
while (edges--) {
int u, v;
int u = 0, v = 0;
std::cin >> u >> v;
graph::addEdge(&adj, u, v);
}
@@ -193,4 +193,4 @@ int main() {
/// running Breadth First Search Algorithm on the graph
graph::beadth_first_search(adj, 0);
return 0;
}
}