Advertisement
Davencode

Demo2

Jan 13th, 2022
22
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,A,u,v)
  2. A'=EMPTY
  3. INIT(G)
  4. dfs_visit(G,u,c1)
  5. if c1[v]=nero then
  6. dfs_visit(GT,v,c2)
  7. for each a in A do
  8. if c1[a]=nero && c2[a]=nero then
  9. A'= A' u {a}
  10. return A'
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement