Data Structures Homework x1

6 years ago · 74387e4b99
parent f8b5b71429
commit 74387e4b99
1 changed files with 0 additions and 2 deletions
--- a/NOIP/2012/blockade.cpp
+++ b/NOIP/2012/blockade.cpp
@ -100,9 +100,7 @@ bool dfs2(int x)
    if (cov[x]) return true;
    for (int t, e = G.adj[x]; e; e = G.E[e].nxt)
        if (t = G.E[e].to, t != fa[0][x])
-        {
            if (!dfs2(t)) return false;
-        }
    return !ch[x].empty();
 }
 int n, m;