st_reachability_undirected (318B)
1 # Undirected st-reachability 2 3 Given an [undirected_graph] and two [vertices] s and t, decide if there is an [undirected_path] between s and t 4 5 [Complete] for [SL], and shown in [L] by [reingold2008undirected]; but open if 6 [L] = [RL] 7 8 Up: [st_reachability] 9 10 Aliases: undirected st-reachability, undirected reachability