|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public static interface AStar.Costs
The definition of an heuristic. The heuristic is in charge of evaluating the distance between the current position and the target.
Method Summary | |
---|---|
double |
cost(org.graphstream.graph.Node parent,
org.graphstream.graph.Edge from,
org.graphstream.graph.Node next)
Cost of displacement from parent to next. |
double |
heuristic(org.graphstream.graph.Node node,
org.graphstream.graph.Node target)
Estimate cost from the given node to the target node. |
Method Detail |
---|
double heuristic(org.graphstream.graph.Node node, org.graphstream.graph.Node target)
node
- A node.target
- The target node.
double cost(org.graphstream.graph.Node parent, org.graphstream.graph.Edge from, org.graphstream.graph.Node next)
parent
- The node we come from.from
- The edge used between the two nodes (in case this is a
multi-graph).next
- The node we go to.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |