DSA-Assignments

commit ec7b9e9ab735c05a7cb69ddc9a458584e7920ef2
parent cee313d6ecbba95b1d629896d33468aace8cf6e0
Author: VictorAdamson <Vall37mo>
Date:   Sun, 10 Dec 2023 22:07:01 +0100

Removed an unnecessary function.

Diffstat:
M
Problem2/Problem2.cpp
 | 
12
------------

1 file changed, 0 insertions(+), 12 deletions(-)
diff --git a/Problem2/Problem2.cpp b/Problem2/Problem2.cpp
@@ -20,7 +20,6 @@ public:
     void addEdge(int src, int dest); //src == Source node, dest == Destintaion node
     bool isEdge(int src, int dest);
     int getNumNodes();
-    void printGraph();
     bool BFS(int src, int dest, int distance[], int predecessor[]);
     void printShortPath(int src, int dest);
 };
@@ -49,16 +48,6 @@ int Graph::getNumNodes() {
     return nodes;
 }
 
-void Graph::printGraph() {
-    for (int src = 0; src < nodes; ++src) {
-        cout << "\nAdjacency list of node " << src << "\n head ";
-        vector<int>::iterator i;
-        for (i = adj[src].begin(); i != adj[src].end(); ++i) {
-            cout << "-> " << *i << " ";
-        }
-    }
-}
-
 bool Graph::BFS(int src, int dest, int distance[], int predecessor[]) {
     list<int> queue;
     vector<bool> visited(nodes, false);
@@ -131,7 +120,6 @@ int main() {
     network.addEdge(1, 3); //B dislikes D
     network.addEdge(2, 3); //C dislikes D
     network.addEdge(2, 1); //C dislikes B
-    //network.printGraph();
     
     cout << endl << "Shortest Path from starting node to end node: \n";
     network.printShortPath(start, end);