st_reachability_undirected (223B)
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] 6 7 Up: [st_reachability] 8 9 Aliases: undirected st-reachability