Tutorials
Graph Searching

Back to Tutorials.

Tutorial 2: Loading A Pre-existing Graph

The Graph Searching Applet comes with several pre-defined examples to allow you to start working with graphs without having to create one yourself. To load an example file, go to the 'File' menu and select 'Load Sample Graph'. A dialog box will open with a drop-down menu allowing you to select a particular example.

image
  • Simple Tree Graph: This is a basic graph example with no cycles.
  • Cyclic Graph Example: This is a graph example with a cycle.
  • Vancouver Neighbourhood Graph: This graph is meant to be part of road network of Vancouver and the aim is to find a path from UBC to SP.
  • Misleading Heuristic Demo: This graph is an example which can demonstrate that some search strategies can be mislead by heuristic information.
  • Multiple Path Pruning Demo: This graph is an example which can demonstrate multiple path pruning.
  • Delivery Robot (acyclic): This example models a delivery robot trying to deliver something to its goal location without any cycles.
  • Delivery Robot (cyclic): This example models a delivery robot trying to deliver something to its goal location with cycles.
  • Module 4 Graph: This graph is a simple graph with cycles and is a good example to learn about the basic search procedures.
  • Module 5 Graph: This graph is meant to be part of the road network for a city. For this graph, the aim is find a path from node mi to the location cp that can only be reached by round-about methods.
  • Bicycle Courier Problem (acyclic): This graph is meant to represent bike trails and the aim is to find a path from mo to nyse without any cycles.
  • Bicycle Courier Problem (cyclic): This graph is meant to represent bike trails and the aim is to find a path from mo to nyse with cycles.

Valid HTML 4.0 Transitional