Solved

Graph Searching

Posted on 2003-10-27
4
185 Views
Last Modified: 2010-03-31
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
Comment
Question by:R6
4 Comments
 
LVL 35

Accepted Solution

by:
TimYates earned 63 total points
ID: 9627056
0
 
LVL 6

Assisted Solution

by:mightyone
mightyone earned 62 total points
ID: 9629613
2d graph with example and code under


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

Featured Post

Better Security Awareness With Threat Intelligence

See how one of the leading financial services organizations uses Recorded Future as part of a holistic threat intelligence program to promote security awareness and proactively and efficiently identify threats.

Join & Write a Comment

Java contains several comparison operators (e.g., <, <=, >, >=, ==, !=) that allow you to compare primitive values. However, these operators cannot be used to compare the contents of objects. Interface Comparable is used to allow objects of a cl…
By the end of 1980s, object oriented programming using languages like C++, Simula69 and ObjectPascal gained momentum. It looked like programmers finally found the perfect language. C++ successfully combined the object oriented principles of Simula w…
This tutorial covers a practical example of lazy loading technique and early loading technique in a Singleton Design Pattern.
This tutorial explains how to use the VisualVM tool for the Java platform application. This video goes into detail on the Threads, Sampler, and Profiler tabs.

747 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question

Need Help in Real-Time?

Connect with top rated Experts

14 Experts available now in Live!

Get 1:1 Help Now