Advertisement
Davencode

Untitled

Dec 29th, 2021
32
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.26 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,v,c1)
  7. if c1[v]=nero then
  8. dfs_visit(GT,v,c2)
  9. for each x in X do
  10. if c2[v]=nero then
  11. dfs_visit(GT,x,c2)
  12. if c1[v]=nero && c2[u]=nero then
  13. return true
  14. return false
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement