Uses of Interface
com.kuka.graph.cost.CostFunction

Packages that use CostFunction

com.kuka.graph.alg	This package contains graph algorithms.
com.kuka.graph.cost	This package contains the base classes and interfaces for cost functions used by graph algorithms.
com.kuka.graph.traverse	This package contains classes for graph traversal.

Uses of CostFunction in com.kuka.graph.alg

Constructors in com.kuka.graph.alg with parameters of type CostFunction

AStar(Graph<N,E> graph, CostFunction<N,E> cost, N start, N goal)
Instantiates a new A*.

AStar(Graph<N,E> graph, CostFunction<N,E> cost, N start, N goal, GraphElementFilter<N> nodeFilter)
Instantiates a new A*.

AStar(Graph<N,E> graph, CostFunction<N,E> cost, N start, N goal, GraphElementFilter<N> nodeFilter, GraphElementFilter<Edge<N>> edgeFilter)
Instantiates a new A*.

Dijkstra(Graph<N,E> graph, CostFunction<N,E> cost, N start)
Executes the dijkstra algorithm.

Dijkstra(Graph<N,E> graph, CostFunction<N,E> cost, N start, GraphElementFilter<N> filter)
Executes the dijkstra algorithm.

Dijkstra(Graph<N,E> graph, CostFunction<N,E> cost, N start, N goal)
Executes the dijkstra algorithm.

Dijkstra(Graph<N,E> graph, CostFunction<N,E> cost, N start, N goal, GraphElementFilter<N> filter)
Executes the dijkstra algorithm.

Dijkstra(Graph<N,E> graph, CostFunction<N,E> cost, N start, Set<N> goals)
Executes the dijkstra algorithm.

Dijkstra(Graph<N,E> graph, CostFunction<N,E> cost, N start, Set<N> goals, Dijkstra.GoalMode mode, GraphElementFilter<Edge<N>> edgeFilter)
Executes the dijkstra algorithm.

Dijkstra(Graph<N,E> graph, CostFunction<N,E> cost, N start, Set<N> goals, Dijkstra.GoalMode mode, GraphElementFilter<N> filter, GraphElementFilter<Edge<N>> edgeFilter)
Executes the dijkstra algorithm.

Dijkstra(Graph<N,E> graph, CostFunction<N,E> cost, N start, Set<N> goals, GraphElementFilter<N> filter)
Executes the dijkstra algorithm.

RRAStar(Graph<N,?> graph, CostFunction<N,?> cost, N start, N goal)
Creates a new RRA* algorithm instance.

Uses of CostFunction in com.kuka.graph.cost

Classes in com.kuka.graph.cost that implement CostFunction

class

AbstractBaseCostFunction<N,E extends Edge<N>> Base implementation for cost functions.

Methods in com.kuka.graph.cost that return CostFunction

static <N,E extends Edge<N>> CostFunction<N,E>	CostFunctions.constant(double cost) Cost function unconditionally returning the specified weight.
static <N,E extends Edge<N>> CostFunction<N,E>	CostFunctions.one() Cost function unconditionally returning the weight 1.
static <N,E extends Edge<N>> CostFunction<N,E>	CostFunctions.zero() Cost function unconditionally returning the weight 0.

Uses of CostFunction in com.kuka.graph.traverse

Methods in com.kuka.graph.traverse with parameters of type CostFunction

T	GraphIterator.setCost(CostFunction<N,?> costFunction) Sets the cost function used for node expansions.
T	AbstractBaseGraphIterator.setCost(CostFunction<N,?> cost)

Constructors in com.kuka.graph.traverse with parameters of type CostFunction

ClosestFirstIterator(Graph<N,?> graph, CostFunction<N,?> cost, N start)
Creates a new closest first iterator starting at the given node and expanding all nodes of the graph.

ClosestFirstIterator(Graph<N,?> graph, CostFunction<N,?> cost, N start, N goal)
Creates a new closest first iterator starting at the given node and expanding all nodes of the graph until the given goal node is found.