Add files via upload

Topological-Sort/01_Topological_BFS.cpp

@@ -0,0 +1,50 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+void BFS(vector<int> adj[], int V, vector<int> &ans)
+{
+    vector<int> indegree(V, 0);
+    for (int i = 0; i < V; i++)
+    {
+        for (auto z : adj[i])
+        {
+            indegree[z]++;
+        }
+    }
+
+    queue<int> q;
+    for (int i = 0; i < V; i++)
+    {
+        if (indegree[i] == 0)
+        {
+            q.push(i);
+        }
+    }
+
+    while (!q.empty())
+    {
+        int x = q.front();
+        q.pop();
+        ans.push_back(x);
+        for (auto z : adj[x])
+        {
+            indegree[z]--;
+            if (indegree[z] == 0)
+            {
+                q.push(z);
+            }
+        }
+    }
+}
+
+int main()
+{
+    int V;
+    vector<int> adj[V];
+
+    vector<bool> visited(V, false);
+    vector<int> ans;
+
+    BFS(adj, V, ans);
+    return 0;
+}

Topological-Sort/02_Topological_DFS.cpp

@@ -0,0 +1,39 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+void DFS(vector<int> adj[], vector<bool> &visited, stack<int> &st, int i)
+{
+    visited[i] = true;
+    for (int x : adj[i])
+    {
+        if (!visited[x])
+        {
+            DFS(adj, visited, st, x);
+        }
+    }
+    st.push(i);
+}
+
+int main()
+{
+    int V;
+    vector<int> adj[V];
+
+    vector<bool> visited(V, false);
+    vector<int> ans;
+    stack<int> st;
+    for (int i = 0; i < V; i++)
+    {
+        if (!visited[i])
+        {
+            DFS(adj, visited, st, i);
+        }
+    }
+
+    while (!st.empty())
+    {
+        ans.push_back(st.top());
+        st.pop();
+    }
+    return 0;
+}