• Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 198
  • Last Modified:

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
0
R6
Asked:
R6
2 Solutions
 
mightyoneCommented:
2d graph with example and code under


http://www.sci.usq.edu.au/staff/leighb/graph/
0

Featured Post

Free Tool: SSL Checker

Scans your site and returns information about your SSL implementation and certificate. Helpful for debugging and validating your SSL configuration.

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

Tackle projects and never again get stuck behind a technical roadblock.
Join Now