Competitive_Programming-And-DSA/Graph/AnotherGraph.cpp at master · TwinkleGupta07/Competitive_Programming-And-DSA · 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
112
113
114
115
116
117
118
#include<iostream>
#include<queue>
using namespace std;

void printDFS(int **edges,int n,int s,bool *visited)
{
     cout<<s<<endl;
     visited[s]=true;
     for(int i=0;i<n;i++)
     {
         if(i==s)
         {
             continue;
         }
         if(edges[s][i]==1)
         {
             if(visited[i])
             {
                 continue;
             }
             printDFS(edges,n,i,visited);
         }
     }
}
void printBFS(int **edges,int n,int s,bool* visited)
{
    queue<int>pendingVertices;
    pendingVertices.push(s);
    visited[s]=true;
    while(!pendingVertices.empty())
    {
        int currentVertex = pendingVertices.front();
        pendingVertices.pop();
        cout<<currentVertex<<endl;
        for(int i=0;i<n;i++)
        {
            if(i==currentVertex)
            {
                continue;
            }
            if(edges[currentVertex][i]==1 && !visited[i])
            {
                pendingVertices.push(i);
                visited[i]=true;
            }
        }

    }
}
void DFS(int **edges, int n)
    {
        bool* visited = new bool[n];
        for(int i=0;i<n;i++)
        {
            visited[i]=false;
        }
        for(int i=0;i<n;i++)
        {
            if(!visited[i])
            {
                printDFS(edges,n,i,visited);
            }
        }
        delete[]visited;
    }

void BFS(int **edges,int n)
{
    bool* visited = new bool[n];
    for(int i=0;i<n;i++)
    {
        visited[i]=false;
    }
    for(int i=0;i<n;i++)
    {
        if(!visited[i])
        {
            printBFS(edges,n,i,visited);
        }
    }
    delete[]visited;
}

int main()
{
    int n,e;
    cin>>n>>e;
    int **edges = new int*[n];
    for(int i=0;i<n;i++)
    {
        edges[i] = new int[n];
        for(int j=0;j<n;j++)
        {
            edges[i][j] =0;
        }
    }
    for(int i=0;i<e;i++)
    {
        int f,s;
        cin>>f>>s;
        edges[f][s]=1;
        edges[s][f]=1;
    }


    cout<<"DFS"<<endl;
    DFS(edges,n);

    cout<<"BFS"<<endl;
    BFS(edges,n);


    for(int i=0;i<n;i++)
    {
        delete[] edges[i];
    }
    delete[] edges;
}