Advertisement
Davencode

Untitled

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