R6
asked on
Graph Searching
Hi experts,
I'm encountering with a graph searching problem that is best to be solved by Breadth-First Search (at least thats what i was told). This problem is about searching for a target in a 2D environment with shortest possible path. The environment is the input to the porgram and the output is a sequence of commands that dictate the shortest path between starting point and the target. Please inspire me experts!
thank you
r6
I'm encountering with a graph searching problem that is best to be solved by Breadth-First Search (at least thats what i was told). This problem is about searching for a target in a 2D environment with shortest possible path. The environment is the input to the porgram and the output is a sequence of commands that dictate the shortest path between starting point and the target. Please inspire me experts!
thank you
r6
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.