st_reachability_directed (316B)
1 # Directed st-reachability 2 3 Given a [directed_graph] and two [vertices] s and t, decide if there is a [directed_path] from s to t 4 5 [NL_complete] 6 7 Up: [st_reachability] on [directed_graphs] 8 9 Aliases: Directed st-reachability, st connectivity directed, directed st connectivity 10 11 See also: [undirected_st-reachability]