Add files via upload

graphs.cpp

@@ -0,0 +1,129 @@
+class graph
+{
+public:
+    int n_v, n_e;
+    vector<vector<int>> adj_list;
+    bool isDirected;
+    vector<bool> vis;
+    vector<int> indeg; //Stores indegree of all Nodes
+    vector<int> topo; //Stores lexicographically smallest toposort
+
+    graph(int n)
+    {
+        n_v = n;
+        adj_list.resize(n);
+        vis.assign(n, false);
+    }
+
+    graph() {}
+
+    void take_input(bool = false);
+
+    void show_adj_list();
+
+    void addEdge(int , int , bool = false);
+
+    void dfs(int );
+
+    void bfs(int );
+
+    bool toposort();
+
+};
+
+void graph::take_input(bool isDir)
+{
+    cin >> n_v >> n_e;
+
+    adj_list.resize(n_v);
+
+    vis.assign(n_v, false);
+
+    int to, fro;
+
+    for (int i = 0; i < n_e; ++i)
+    {
+        cin >> to >> fro;
+        addEdge(to - 1, fro - 1, isDir);
+    }
+}
+
+void graph::show_adj_list()
+{
+
+    cout << "No. of Vertices = " << n_v << endl;
+
+    cout << "No. of Edges = " << n_e << endl;
+
+    for (int i =  0 ; i < n_v; i++)
+    {
+        cout << i << "-> ";
+
+        for (int j = 0; j < adj_list[i].size(); j++)
+            cout << adj_list[i][j] << " ";
+
+        cout << endl;
+    }
+}
+
+void graph::addEdge(int to, int fro, bool isDir)
+{
+    adj_list[to].push_back(fro);
+
+    if (!isDir)
+        adj_list[fro].push_back(to);
+}
+
+void graph::dfs(int source)
+{
+    vis[source] = true;
+
+    //cout<<source+1<<" ";
+
+    int i;
+
+    for (int i = 0; i < adj_list[source].size(); i++)
+    {
+        int v = adj_list[source][i];
+
+        if (!vis[v])
+            dfs(v);
+    }
+}
+
+void graph::bfs(int source)
+{
+
+    queue<int> q;
+
+    q.push(source);
+
+    vis[source] = true;
+
+    while (!q.empty())
+    {
+        int parent = q.front();
+
+        cout << parent + 1 << " ";
+
+        q.pop();
+
+
+
+        for (int child = 0; child < adj_list[parent].size(); child++)
+        {
+            int v = adj_list[parent][child];
+            if (!vis[v])
+            {
+                q.push(v);
+                vis[v] = true;
+            }
+        }
+    }
+}
+
+/*Use Case
+  graph g;
+    g.take_input();
+    g.show_adj_list();
+*/