1suppose Maze Exists May May Solvable Want Determine Maze Solvable Algorithm Helpful Minim Q37120200

1.Suppose that a maze exists, but may or may not be solvable.You want to determine if the maze is solvable. What algorithm willbe most helpful?

Minimal Spanning Tree

Union/Find

Maximal flow

Shortest Path

2.We have two sets: People and Candy Bars. A perfect matching isa matching in which every item in the People set is paired with anitem in the Candy Bar set, such that all Candy Bars are matched.What kind of algorithm would be most helpful?

Maximum flow

Minimal Spanning tree

Shortest Path

Topological Ordering

3. We need to build a connected network. We have a limited setof possible routes, and we want to select a subset that will

OR

 

OR