-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCourse_Schedule_DFS.cpp
More file actions
76 lines (60 loc) · 2.27 KB
/
Course_Schedule_DFS.cpp
File metadata and controls
76 lines (60 loc) · 2.27 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
//
// Created by adity on 30-11-2024.
//
#include "Course_Schedule_DFS.h"
#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
class Solution {
public:
bool isCycleDFS(unordered_map<int, vector<int>> &adj, int u, vector<bool> &visited, vector<bool> &inRec) {
visited[u] = true;
inRec[u] = true;
for (int &v : adj[u]) {
// If not visited, perform DFS on v
if (!visited[v] && isCycleDFS(adj, v, visited, inRec))
return true; // Cycle detected
else if (inRec[v])
return true;
}
inRec[u] = false;
return false; // No cycle detected
}
bool canFinish(int numCourses, vector<vector<int>> &prerequisites) {
unordered_map<int, vector<int>> adj;
vector<bool> visited(numCourses, false);
vector<bool> inRec(numCourses, false);
for (auto &vec : prerequisites) {
int a = vec[0];
int b = vec[1];
// b --> a
adj[b].push_back(a);
}
for (int i = 0; i < numCourses; i++) {
if (!visited[i] && isCycleDFS(adj, i, visited, inRec))
return false; // Cannot complete all courses
}
return true; // All courses can be completed
}
};
int main() {
Solution solution;
// Test case 1
int numCourses1 = 2;
vector<vector<int>> prerequisites1 = {{1, 0}};
cout << "Can finish courses (Test case 1): " << (solution.canFinish(numCourses1, prerequisites1) ? "true" : "false") << endl;
// Test case 2
int numCourses2 = 2;
vector<vector<int>> prerequisites2 = {{1, 0}, {0, 1}};
cout << "Can finish courses (Test case 2): " << (solution.canFinish(numCourses2, prerequisites2) ? "true" : "false") << endl;
// Test case 3
int numCourses3 = 4;
vector<vector<int>> prerequisites3 = {{1, 0}, {2, 1}, {3, 2}};
cout << "Can finish courses (Test case 3): " << (solution.canFinish(numCourses3, prerequisites3) ? "true" : "false") << endl;
// Test case 4
int numCourses4 = 4;
vector<vector<int>> prerequisites4 = {{1, 0}, {2, 1}, {3, 2}, {1, 3}};
cout << "Can finish courses (Test case 4): " << (solution.canFinish(numCourses4, prerequisites4) ? "true" : "false") << endl;
return 0;
}