Graph/transitive_Closure_Using_DFS.cpp at master · arpansahu/Graph · 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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138

#include "iostream"
#include "vector"
#include "set"
#include "map"
using namespace std;

struct Edge {
    int source,destination;
};

class Graph{
    int V;
    vector<vector<int>> adjList;
public:

    Graph(vector<Edge> edges,int V){
        this->V = V;
        adjList.resize(V);
        for(auto i : edges){
            adjList[i.source].push_back(i.destination);
        }
    }

    void transitive_Closure_Using_DFS();
    void printGraph();
    void DFS(vector<vector<int>> &T,int vertex );

};

void Graph :: printGraph()
{
    for (int i = 0; i < adjList.size(); i++)
    {
        cout << i << " -- ";
        for (int v : adjList[i])
            cout <<"->"<< v << " ";
        cout << endl;
    }
}

void Graph :: DFS(vector<vector<int>> &T,int vertex ){
    T[vertex][vertex] = 1;
    for(auto i : adjList[vertex]){
        if(!T[vertex][i]) {T[vertex][i]= 1; DFS(T,i);}
    }
}
void Graph ::transitive_Closure_Using_DFS() {
    vector<int> temp (V,0);
    vector<vector<int>> T(V,temp);
    for (int i = 0; i < V ; i++)  DFS(T,i);
    for (auto  i: T) { for(auto j : i ) cout << j << " ";cout <<"\n";}
}

int main()

{

    vector<Edge> edges ={  		{ 0, 2 }, { 1, 0 }, { 3, 1 }
    };

    set <int > setsize;
    for(auto  i : edges){ setsize.insert(i.source);setsize.insert(i.destination);}
    int V = setsize.size();
    Graph graph(edges, V);
    graph.transitive_Closure_Using_DFS();
    return 0;
}
#include "iostream"
#include "vector"
#include "set"
#include "map"
using namespace std;

struct Edge {
    int source,destination;
};

class Graph{
    int V;
    vector<vector<int>> adjList;
    vector<int> indegree;
public:

    Graph(vector<Edge> edges,int V){
        this->V = V;
        adjList.resize(V);
        indegree.resize(V,0);
        for(auto i : edges){
            adjList[i.source].push_back(i.destination);
            indegree[i.destination]++;
        }
    }

    void transitive_Closure_Using_DFS();
    void printGraph();
    void DFS(vector<vector<int>> &T,int vertex );

};

void Graph :: printGraph()
{
    for (int i = 0; i < adjList.size(); i++)
    {
        cout << i << " -- ";
        for (int v : adjList[i])
            cout <<"->"<< v << " ";
        cout << endl;
    }
}

void Graph :: DFS(vector<vector<int>> &T,int vertex ){
    T[vertex][vertex] = 1;
    for(auto i : adjList[vertex]){
        if(!T[vertex][i]) {T[vertex][i]= 1; DFS(T,i);}
    }
}
void Graph ::transitive_Closure_Using_DFS() {
    vector<int> temp (V,0);
    vector<vector<int>> T(V,temp);
    for (int i = 0; i < V ; i++)  DFS(T,i);
    for (auto  i: T) { for(auto j : i ) cout << j << " ";cout <<"\n";}
}

int main()

{

    vector<Edge> edges ={  		{ 0, 2 }, { 1, 0 }, { 3, 1 }
    };

    set <int > setsize;
    for(auto  i : edges){ setsize.insert(i.source);setsize.insert(i.destination);}
    int V = setsize.size();
    Graph graph(edges, V);
    graph.transitive_Closure_Using_DFS();
    return 0;
}