DAA_LAB/graph1.cpp at main · Divyanshupanwar/DAA_LAB · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
#include <bits/stdc++.h>
using namespace std;
class Graph
{
public:
    int v;
    vector<list<int>> adj;
    Graph(int vertices) : v(vertices), adj(vertices) {};
    void addEdge(int u, int v)
    {
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    void display()
    {
        for (int i = 0; i < v; i++)
        {
            cout << i << "->";
            for (auto it : adj[i])
            {
                cout << it << " ";
            }
            cout << endl;
        }
    }
};
void utill(Graph &g, int src, vector<bool> &visited)
{
    visited[src] = true;
    cout << src << " ";
    for (auto it : g.adj[src])
    {
        if (!visited[it])
            utill(g, it, visited);
    }
}

void dfs(Graph &g, int src)
{
    int v = g.v;
    vector<bool> visited(v, false);
    utill(g, src, visited);
}
bool utill1(Graph &g, int src, vector<bool> &visited, vector<bool> &inRecursionStack)
{
    visited[src] = true;
    inRecursionStack[src] = true;

    for (auto it : g.adj[src])
    {
        if (!visited[it])
        {

            if (utill1(g, it, visited, inRecursionStack))
                return true;
        }
        else if (inRecursionStack[it])
        {
            return true;
        }
    }
    inRecursionStack[src] = false;
    return false;
}

bool dfs1(Graph &g, int src)
{
    int v = g.v;
    vector<bool> visited(v, false);
    vector<bool> inRecursionStack(v, false);
    return utill1(g, src, visited, inRecursionStack);
}

void bfs(Graph &g, int src)
{
    int v = g.v;
    vector<bool> visited(v, false);
    queue<int> q;
    visited[src] = true;
    q.push(src);
    ;
    while (!q.empty())
    {
        int node = q.front();
        q.pop();

        cout << node << " ";
        for (auto it : g.adj[node])
        {
            if (!visited[it])
            {
                visited[it] = true;
                q.push(it);
            }
        }
    }
    cout << endl;
}

int main()
{
    Graph g(5);
    g.addEdge(0, 1);
    g.addEdge(0, 2);


    cout << "cycle or not:" << dfs1(g, 0) << endl;
    g.display();

    return 0;
}