public class

UndirectedGraphSearchExample

extends Object
java.lang.Object
   ↳ es.usc.citius.hipster.examples.UndirectedGraphSearchExample

Class Overview

Example of graph search with manual creation of the graph structure.

In this example an undirected HipsterGraph is created, and then a search using DFS is executed. Summarized characteristics of this example are:

  • Uses GraphSearchProblem, a subclass of SearchProblem specially designed to facilitate working with graph search problems.
  • An undirected graph is created introducing manually the data in the HipsterGraph.
  • Cost function takes the cost of moving between cities from the arcs of the graph.
In this example the search problem is defined from the initial state, extracting the costs from the arcs of the graph. The goal is set after creating the search problem, at the end.

Since DFS is an uninformed search algorithm an heuristic is not needed to be defined.

Summary

Public Constructors
UndirectedGraphSearchExample()
Public Methods
static void main(String[] args)
[Expand]
Inherited Methods
From class java.lang.Object

Public Constructors

public UndirectedGraphSearchExample ()

Public Methods

public static void main (String[] args)