-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGraphAllPath.cpp
More file actions
94 lines (80 loc) · 2.4 KB
/
Copy pathGraphAllPath.cpp
File metadata and controls
94 lines (80 loc) · 2.4 KB
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
#include <iostream>
#include <map>
#include <vector>
using namespace std;
template <typename T>
class Graph {
private:
map<T, vector<T>> adjList;
public:
Graph() {}
void addEdge(T src, T dest, bool directed) {
if (directed) {
this->adjList[src].push_back(dest);
} else {
this->adjList[src].push_back(dest);
this->adjList[dest].push_back(src);
}
}
void dfsUtil(T src, map<T, bool>& visited) {
cout << src << " ";
visited[src] = true;
for (T neighbor : adjList[src]) {
if (!visited[neighbor]) {
dfsUtil(neighbor, visited);
}
}
}
void dfs(T src) {
map<T, bool> visited;
dfsUtil(src, visited);
}
void allPathsUtil(T src, T dest, map<T, bool>& visited, vector<T>& paths) {
visited[src] = true;
paths.push_back(src);
if (src == dest) {
for (const T& vertex : paths) {
cout << vertex << " ";
}
cout << endl;
} else {
for (const auto& neighbor : this->adjList[src]) {
if (!visited[neighbor]) {
allPathsUtil(neighbor, dest, visited, paths);
}
}
}
paths.pop_back();
visited[src] = false;
}
void allPath(T src, T dest) {
map<T, bool> visited;
vector<T> paths;
for (const auto& vertex : this->adjList) {
visited[vertex.first] = false;
}
allPathsUtil(src, dest, visited, paths);
}
};
Graph<string> createLocalGraph(Graph<string> g) {
g.addEdge("Chuadanga", "Meherpur", false);
g.addEdge("Chuadanga", "Alamdanga", false);
g.addEdge("Alamdanga", "Kushtia", false);
g.addEdge("Meherpur", "Kushtia", false);
g.addEdge("Kushtia", "Pabna", false);
g.addEdge("Pabna", "Rajshahi", false);
g.addEdge("Chuadanga", "Jhenaidah", false);
g.addEdge("Jhenaidah", "Kushtia", false);
g.addEdge("Jhenaidah", "Jashore", false);
g.addEdge("Jashore", "Khulna", false);
return g;
}
int main() {
Graph<string> g;
g = createLocalGraph(g);
g.allPath("Khulna", "Rajshahi");
// Khulna Jashore Jhenaidah Chuadanga Meherpur Kushtia Pabna Rajshahi
// Khulna Jashore Jhenaidah Chuadanga Alamdanga Kushtia Pabna Rajshahi
// Khulna Jashore Jhenaidah Kushtia Pabna Rajshahi
return 0;
}