UC Berkeley Group for User Interface Research
Updated November 17, 2000

Uses of Class
edu.berkeley.guir.lib.graphs.Path

Packages that use Path
edu.berkeley.guir.lib.graphs Some simple graph utilities. 
 

Uses of Path in edu.berkeley.guir.lib.graphs
 

Methods in edu.berkeley.guir.lib.graphs that return Path
 Path SearchBreadthFirst.search(Graph g, String strFrom, String strTo)
          Perform a breadth-first search on the graph, with the specified start and target nodes.
 Path SearchBidirBlind.search(Graph g, String strFrom, String strTo)
          Perform a bidirectional blind search on the graph, with the specified start and target nodes.
 Path GraphSearch.search(Graph g, String strFrom, String strTo)
          Perform a search on the graph, with the specified start and target nodes.
 Path SearchBidirBest.search(Graph g, String strFrom, String strTo)
          Perform a bidirectional Best search on the graph, with the specified start and target nodes.
 Path SearchBestFirst.search(Graph g, String strFrom, String strTo)
          Perform a best-first search on the graph, with the specified start and target nodes.
 Path SearchDepthFirst.search(Graph g, String strFrom, String strTo)
          Perform a depth-first search on the graph, with the specified start and target nodes.
 

Methods in edu.berkeley.guir.lib.graphs with parameters of type Path
 void PathTree.addPath(Path p)
          Adds a path into this hierarchy tree.
 


Copyright Information