Simple Tree Graph, simpletree.xml, This is a basic graph example with no cycles.
Extended Tree Graph, extendedtree.xml, This is a basic graph example with no cycles.
Cyclic Graph Example, cyclicgraph.xml, This is a graph example with a cycle.
Vancouver Neighbourhood Graph, vancouver.xml, 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, misleadingheuristic.xml, This graph is an example which can demonstrate that some search strategies can be mislead by heuristic information.
Multiple-Path Pruning Demo, multiplepathpruning.xml, This graph is an example which can demonstrate multiple path pruning.
Delivery Robot (acyclic), acyclicdelivery.xml, This example models a delivery robot trying to deliver something to its goal location without any cycles.
Delivery Robot (cyclic), cyclicdelivery.xml, This example models a delivery robot trying to deliver something to its goal location with cycles.
Module 4 Graph, mod4gr1999.xml, This graph is a simple graph with cycles and is a good example to learn about the basic search procedures.
Module 5 Graph, mod5gr1999.xml, 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), acyclicbicycle.xml, 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), cycliccourier.xml, This graph is meant to represent bike trails and the aim is to find a path from mo to nyse with cycles.
