Lecture 26
Wednesday, July 24, 2019
11:44 AM
Algo Unreach ( G, s, t)
%%  given  N = # nodes reachable from  s
count = 0
for every node v
      "make a nondeterm. guess if v is reachable from s"
if guess is YES then 
    "nondterm. guess a path from s to v of length at most n"
     if "guessed path does not lead to v" then Reject 
endif
if v=t then Reject
else count = count+1
endif
endfor
if count < N then Reject
else Accept
endif