Uses of Interface
com.kuka.graph.Edge

Packages that use Edge

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.impl	This package contains the base implementations of the graph and edge interface.
com.kuka.graph.traverse	This package contains classes for graph traversal.

Uses of Edge in com.kuka.graph.alg

Classes in com.kuka.graph.alg with type parameters of type Edge

class	AStar<N,E extends Edge<N>> Implementation of the A* path finding algorithm.
class	Dijkstra<N,E extends Edge<N>> Implements a basic Dijkstra algorithm.

Method parameters in com.kuka.graph.alg with type arguments of type Edge

RRAStar<N>

RRAStar.setEdgeFilter(GraphElementFilter<Edge<N>> edgeFilter) Sets the filter specifying whether an edge may be traversed or must not be included in the path.

Constructor parameters in com.kuka.graph.alg with type arguments of type Edge

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, 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.

Uses of Edge in com.kuka.graph.cost

Classes in com.kuka.graph.cost with type parameters of type Edge

class

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

Methods in com.kuka.graph.cost with type parameters of type Edge

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 Edge in com.kuka.graph.impl

Classes in com.kuka.graph.impl with type parameters of type Edge

class	AbstractBaseGraph<N,E extends Edge<N>> Abstract base implementation for directed graphs.
class	AbstractBaseListenableGraph<N,E extends Edge<N>> Super class for all directed graphs that support listeners on structural change events.
class	BasePath<N,E extends Edge<N>> Class realizing a path in a directed graph.
class	FastUncheckedGraph<N,E extends Edge<N>> Implements a graph as incidence map.
class	FastUncheckedPath<N,E extends Edge<N>> Implements a path.
class	Subgraph<N,E extends Edge<N>> Class realizing a subgraph of a directed graph.
class	TransposeGraph<N,E extends Edge<N>> In the mathematical and algorithmic study of graph theory, the converse, transpose or reverse of a directed graph G is another directed graph on the same set of vertices with all of the edges reversed compared to the orientation of the corresponding edges in G.

Classes in com.kuka.graph.impl that implement Edge

class

DefaultEdge<N> Simple realization of a directed edge.

Uses of Edge in com.kuka.graph.traverse

Method parameters in com.kuka.graph.traverse with type arguments of type Edge

T	GraphIterator.setEdgeFilter(GraphElementFilter<Edge<N>> filter) Sets an edge filter for this node iterator.
T	AbstractBaseGraphIterator.setEdgeFilter(GraphElementFilter<Edge<N>> filter)