There was an error while loading. Please reload this page.
1 parent c329c4e commit 9fdd5daCopy full SHA for 9fdd5da
BFS/207.Course-Schedule/Readme.md
@@ -20,6 +20,7 @@ DFS的基本思想是从任意一个未访问过的节点开始做DFS的遍历
20
```cpp
21
bool dfs(int cur)
22
{
23
+ if (visited[cur]==1) return true;
24
visited[cur] = 2;
25
for (int next: graph[cur])
26
0 commit comments