Added Python Programs

.github/workflows/environment.yml

@@ -0,0 +1,8 @@
+name: base
+channels:
+  - defaults
+dependencies:
+  - python=3.10
+  - pip
+  - flake8
+  - pytest

C++ Code/bellman_ford.cpp

@@ -0,0 +1,41 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+struct Edge {
+    int u, v, w;
+};
+
+void bellmanFord(int n, int start, vector<Edge>& edges) {
+    vector<int> dist(n, INT_MAX);
+    dist[start] = 0;
+
+    for (int i = 0; i < n - 1; i++) {
+        for (auto& e : edges) {
+            if (dist[e.u] != INT_MAX && dist[e.u] + e.w < dist[e.v]) {
+                dist[e.v] = dist[e.u] + e.w;
+            }
+        }
+    }
+
+    for (auto& e : edges) {
+        if (dist[e.u] != INT_MAX && dist[e.u] + e.w < dist[e.v]) {
+            cout << "Negative weight cycle detected!\n";
+            return;
+        }
+    }
+
+    cout << "Bellman-Ford Shortest Distances:\n";
+    for (int i = 0; i < n; i++)
+        cout << "Node " << i << ": " << dist[i] << endl;
+}
+
+int main() {
+    int n = 5;
+    vector<Edge> edges = {
+        {0, 1, -1}, {0, 2, 4}, {1, 2, 3}, {1, 3, 2},
+        {1, 4, 2}, {3, 2, 5}, {3, 1, 1}, {4, 3, -3}
+    };
+
+    bellmanFord(n, 0, edges);
+    return 0;
+}

C++ Code/bfs.cpp

@@ -0,0 +1,36 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+void BFS(int start, vector<vector<int>>& adj) {
+    int n = adj.size();
+    vector<bool> visited(n, false);
+    queue<int> q;
+
+    visited[start] = true;
+    q.push(start);
+
+    cout << "BFS Traversal: ";
+    while (!q.empty()) {
+        int node = q.front();
+        q.pop();
+        cout << node << " ";
+
+        for (int neighbor : adj[node]) {
+            if (!visited[neighbor]) {
+                visited[neighbor] = true;
+                q.push(neighbor);
+            }
+        }
+    }
+    cout << endl;
+}
+
+int main() {
+    int n = 5;
+    vector<vector<int>> adj = {
+        {1, 2}, {0, 3, 4}, {0, 4}, {1}, {1, 2}
+    };
+
+    BFS(0, adj);
+    return 0;
+}

C++ Code/dfs.cpp

@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+void DFSUtil(int node, vector<vector<int>>& adj, vector<bool>& visited) {
+    visited[node] = true;
+    cout << node << " ";
+
+    for (int neighbor : adj[node]) {
+        if (!visited[neighbor])
+            DFSUtil(neighbor, adj, visited);
+    }
+}
+
+void DFS(int start, vector<vector<int>>& adj) {
+    int n = adj.size();
+    vector<bool> visited(n, false);
+    cout << "DFS Traversal: ";
+    DFSUtil(start, adj, visited);
+    cout << endl;
+}
+
+int main() {
+    int n = 5;
+    vector<vector<int>> adj = {
+        {1, 2}, {0, 3, 4}, {0, 4}, {1}, {1, 2}
+    };
+
+    DFS(0, adj);
+    return 0;
+}

C++ Code/dijkstra.cpp

@@ -0,0 +1,47 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+void dijkstra(int start, vector<vector<pair<int, int>>>& adj) {
+    int n = adj.size();
+    vector<int> dist(n, INT_MAX);
+    dist[start] = 0;
+
+    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> pq;
+    pq.push({0, start});
+
+    while (!pq.empty()) {
+        int d = pq.top().first;
+        int node = pq.top().second;
+        pq.pop();
+
+        if (d > dist[node]) continue;
+
+        for (auto& edge : adj[node]) {
+            int next = edge.first;
+            int weight = edge.second;
+
+            if (dist[node] + weight < dist[next]) {
+                dist[next] = dist[node] + weight;
+                pq.push({dist[next], next});
+            }
+        }
+    }
+
+    cout << "Dijkstra Shortest Distances:\n";
+    for (int i = 0; i < n; i++)
+        cout << "Node " << i << ": " << dist[i] << endl;
+}
+
+int main() {
+    int n = 5;
+    vector<vector<pair<int, int>>> adj(n);
+
+    adj[0] = {{1, 2}, {2, 4}};
+    adj[1] = {{2, 1}, {3, 7}};
+    adj[2] = {{4, 3}};
+    adj[3] = {{4, 1}};
+    adj[4] = {};
+
+    dijkstra(0, adj);
+    return 0;
+}