edu.berkeley.guir.lib.graphs
Interface GraphSearch

All Known Implementing Classes:

SearchBidirBlind, SearchBreadthFirst, SearchBidirBest, SearchBestFirst, SearchDepthFirst

public interface GraphSearch

An interface that defines a graph search method.

This software is distributed under the Berkeley Software License.

 Revisions:  - GUIRLib-v1.0-1.0.0, Dec 20 1997, JH
               Created class
             - GUIRLib-v1.0-1.1.0, Feb 24 2000, JH
               Updated for JDK1.3RC1 to use the Collections
             - GUIRLib-v1.2-1.0.0, Jun 22 2000, JH
               Touched for GUIRLib release
             - GUIRLib-v1.3-1.0.0, Aug 11 2000, JH
               Touched for GUIRLib release
             - GUIRLib-v1.4-1.0.0, Aug 31 2000, JH
               Touched for GUIRLib release
 

Since:

1.1.4

Version:

GUIRLib-v1.4-1.0.0, Aug 31 2000

Author:

Jason Hong ( jasonh@cs.berkeley.edu)

Method Summary

Path	search(Graph g, String strFrom, String strTo) Perform a search on the graph, with the specified start and target nodes.

Method Detail

search

public Path search(Graph g,
                   String strFrom,
                   String strTo)

Perform a search on the graph, with the specified start and target nodes.

Parameters:

g - is a reference to the Graph we are searching in.

strFrom - is the name of the starting node.

strTo - is the name of the target node.

Returns:

Returns a successful Path found from the start node to the target node. The Path is empty if no successful Path is found, or if either the start or target node does not exist in the Graph.