public class

DirectedGraphSearchExample

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

Class Overview

Example that creates a HipsterDirectedGraph, creates a search problem to be used with Hipster search iterators and performs a search using the Dijkstra algorithm. The starting node is set in the creation of a SearchProblem, which also specifies the source of the search (a graph in this case) and the cost function (costs taken from the edges of the graph). The goal node is specified after creating the problem, in the search method. As it is not required to create the search iterator.

Summary

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

Public Constructors

public DirectedGraphSearchExample ()

Public Methods

public static void main (String[] args)