st_reachability (378B)
1 # st-reachability 2 3 Given a [graph] and two [vertices] s and t, decide if there is a [path] from s to t 4 5 [survey]: [widgerson1992complexity] 6 7 - [st_reachability_undirected] 8 - [st_reachability_directed] 9 - [st_reachability_provenance] 10 - [st_reachability_dynamic] 11 12 Up: [dynamic_graph] 13 14 See also: [network_reliability], [st_shortest_path], [st_reliability] 15 16 Aliases: st-connectivity