| Home | Trees | Indices | Help |
|
|---|
|
|
An implementation of the graph searching heuristic proposed by Edmond Chow.
Remember to call the optimize() method before the
heuristic search.
For details, check: http://www.edmondchow.com/pubs/levdiff-aaai.pdf.
| Instance Methods | |||
|
|||
|
|||
|
|||
|
Inherited from |
|||
| Properties | |
|
Inherited from |
| Method Details |
Initialize a Chow heuristic object.
|
Build a dictionary mapping each pair of nodes to a number (the distance between them).
|
Estimate how far start is from end.
|
| Home | Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Sat Mar 20 19:11:54 2010 | http://epydoc.sourceforge.net |