Reachability Time Complexity

[peter982]

Hi everyone, I am trying to solve the following problem:

I want to implement a DETERMINISTIC algorithm for direct graph reachability problem. I know that the problem is NL-complete for non-deterministic algorithms, but what about TIME complexity for DETERMINISTIC algorithms?

Any ideas? Unfortunately literature does not help..

Thanks!