Examples of AStarIterator

org.geotools.graph.traverse.standard.AStarIterator

(n,n') : the real cost to go from n to n' OPEN=[Source] CLOSE=[] while ( |OPEN| > 0 ) n = a node in OPEN with less f remove n from OPEN add n to CLOSE if ( n == target ) { return // path find // if n != target for each node n' that relates to n do if n' in OPEN if (g(n) + COST(n,n')) < g(n') g(n') = g(n) + COST(n,n') parent(n') = n else g(n') = g(n) + COST(n,n') parent(n') = n add n' to OPEN // end while For more details see http://en.wikipedia.org/wiki/A_star @author Germán E. Trouillet, Francisco G. Malbrán. Universidad Nacional de Córdoba (UNC) @source $URL$

        public AStarShortestPathFinder (
                            Graph graph, Node source, Node target, AStarFunctions afuncs
        ) {
                m_graph = graph;
                m_target = target;
                m_iterator = new AStarIterator(source, afuncs);
                m_traversal = new BasicGraphTraversal(graph,this,m_iterator);
        }

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.

Examples of AStarIterator

Examples of org.geotools.graph.traverse.standard.AStarIterator