DSA-Assignments

commit 908b2e7c933702182ed7c705c852cac5fc081955
parent ec7b9e9ab735c05a7cb69ddc9a458584e7920ef2
Author: VictorAdamson <Vall37mo>
Date:   Sun, 10 Dec 2023 23:08:15 +0100

Changed list to queue

Diffstat:
M
Problem2/Problem2.cpp
 | 
8
++++----

1 file changed, 4 insertions(+), 4 deletions(-)
diff --git a/Problem2/Problem2.cpp b/Problem2/Problem2.cpp
@@ -49,7 +49,7 @@ int Graph::getNumNodes() {
 }
 
 bool Graph::BFS(int src, int dest, int distance[], int predecessor[]) {
-    list<int> queue;
+    queue<int> queue;
     vector<bool> visited(nodes, false);
 
     for (int i = 0; i < nodes; i++) {
@@ -60,17 +60,17 @@ bool Graph::BFS(int src, int dest, int distance[], int predecessor[]) {
 
     visited[src] = true;
     distance[src] = 0;
-    queue.push_back(src);
+    queue.push(src);
 
     while (!queue.empty()) {
         int current = queue.front();
-        queue.pop_front();
+        queue.pop();
         for (auto adjacent : adj[current]) {
             if (!visited[adjacent]) {
                 visited[adjacent] = true;
                 distance[adjacent] = distance[current] + 1;
                 predecessor[adjacent] = current;
-                queue.push_back(adjacent);
+                queue.push(adjacent);
                 if (adjacent == dest) return true;
             }
         }