Advertisement
Davencode

Untitled

Jan 2nd, 2022
24
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.15 KB | None | 0 0
  1. ALGO(G,a,b,c,d)
  2. INIT(G)
  3. GT=trasposto(G)
  4. dfs_visit(G,a,c1)
  5. dfs_visit(GT,b,c2)
  6. if c1[c]=n && c1[d]=n && c2[c]=n && c2[d]=n then
  7. return true
  8. return false
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement