01 package dk.deepthought.sidious.planner; 02  03 import dk.deepthought.sidious.planner.graph.Graph; 04  05 /** 06  * This interface defines the pathfinding algorithm. 07  *  08  * @author Deepthought 09  *  10  */ 11 public interface Pathfinder { 12  13     /** 14      * This is the search algorithm. 15      *  16      * @param graph 17      *            the graph to be searched 18      */ 19     public void search(Graph graph); 20  21     /** 22      * Cancels the search. 23      */ 24     public void cancel(); 25  26 }