dftk
[ class tree: dftk ] [ index: dftk ] [ all elements ]

Class: DftkAiIDAstar

Source Location: /ai/dftk_ai_idastar.php

Class Overview


DFTK IDA* algorithm


Author(s):

Methods


Inherited Variables

Inherited Methods


Class Details

[line 46]
DFTK IDA* algorithm



Tags:

access:  public
author:  Duck <mailto:duck@DuckCorp.org>


[ Top ]


Class Methods


constructor DftkAiIDAstar [line 118]

DftkAiIDAstar DftkAiIDAstar( object DftkDaTraceManager &$tracemgr)

Constructor



Tags:

access:  public


Parameters:

object DftkDaTraceManager   &$tracemgr   Language Manager

[ Top ]

method get_path [line 275]

object DftkDaTrace &get_path( string $start_node, string $stop_node)

Get the path to go from one node to another



Tags:

return:  Trace
access:  public


Parameters:

string   $start_node   Start node
string   $stop_node   Stop node

[ Top ]

method set_cost_fct [line 186]

void &set_cost_fct( mixed $cost_fct)



[ Top ]

method set_heuristic_fct [line 215]

void &set_heuristic_fct( mixed $heuristic_fct)



[ Top ]

method set_node_list [line 162]

object DftkDaTrace &set_node_list( array $node_list)

Set node list

The node list contains the one-way roads to other nodes; to use both-way roads you have to specify two one-way roads.

Node list is indexed by <node_name> and contains these fields :

  • 'successors' : array
  • 'data' : optional user field
Each element of the 'successors' array is a couple (array) :
  • <next_node_name>
  • <road_name>
The road name is only informational.

The 'data' field can contain whatever data the user need to compute cost and heuritic values (eg. geographic position).




Tags:

return:  Trace
access:  public


Parameters:

array   $node_list   Node list

[ Top ]

method set_successor_selection_fct [line 242]

void &set_successor_selection_fct( mixed $successor_selection_fct)



[ Top ]


Documentation generated on Sat, 6 Dec 2003 13:47:33 +0100 by phpDocumentor 1.2.3