Advertisement
Davencode

Untitled

Dec 28th, 2021
33
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.24 KB | None | 0 0
  1. ALGO(G,X,u,v)
  2. INIT(G)
  3. dfs_visit(G,u,c1)
  4. for each x in X do
  5. if c1[x]=nero then
  6. dfs_visit(G,x,c1)
  7. dfs_visit(GT,v,c2)
  8. for each x in X do
  9. if c3[x]=nero then
  10. dfs_visit(GT,x,c2)
  11. if c1[v]=nero && c2[u]=nero then
  12. return true
  13. return false
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement