Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //проверка ацикличности графа. если cycle - true - цикл есть.
- void dfs(int v, vector < vector < int>>& mas, vector < char>& colors, bool& cycle) {
- if (colors[v] == 'G') {
- cycle = true;
- return;
- }
- else if (colors[v] == 'B') {
- return;
- }
- else {
- colors[v] = 'G';
- }
- //проверка всех ребер исходящих от mas[v]
- for (int soldat : mas[v]) {
- dfs(soldat, mas, colors, cycle);
- }
- colors[v] = 'B';
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement