Advertisement
Davencode

es2

Jan 17th, 2022
28
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.17 KB | None | 0 0
  1. ALGO(G,B)
  2. init(G)
  3. for each v in V do
  4. if c1[v]=b then
  5. dfs_visit(G,v,c1)
  6. for each b in B do
  7. if c1[b]=n then
  8. if dfs_visitciclo(G,b,c3) then
  9. return true
  10. return false
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement