A B C D E F G H I L N O P R S T U V W Z

A

AbstractBaseCostFunction<N,E extends Edge<N>> - Class in com.kuka.graph.cost
Base implementation for cost functions.
AbstractBaseCostFunction() - Constructor for class com.kuka.graph.cost.AbstractBaseCostFunction
 
AbstractBaseGraph<N,E extends Edge<N>> - Class in com.kuka.graph.impl
Abstract base implementation for directed graphs.
AbstractBaseGraph() - Constructor for class com.kuka.graph.impl.AbstractBaseGraph
 
AbstractBaseGraphIterator<T extends AbstractBaseGraphIterator<T,N>,N> - Class in com.kuka.graph.traverse
base implementation for graph iterators.
AbstractBaseGraphIterator(AbstractBaseGraphIterator.NodeQueue<N>, Graph<N, ?>, N) - Constructor for class com.kuka.graph.traverse.AbstractBaseGraphIterator
Creates a new graph iterator.
AbstractBaseGraphIterator.NodeQueue<A> - Interface in com.kuka.graph.traverse
Interface representing a node queue.
AbstractBaseListenableGraph<N,E extends Edge<N>> - Class in com.kuka.graph.impl
Super class for all directed graphs that support listeners on structural change events.
AbstractBaseListenableGraph() - Constructor for class com.kuka.graph.impl.AbstractBaseListenableGraph
 
AbstractGraph<N,E> - Class in com.kuka.graph.impl
Abstract superclass for all graphs, implementing base functionality common to all graphs.
AbstractGraph() - Constructor for class com.kuka.graph.impl.AbstractGraph
 
accept(E) - Method in interface com.kuka.graph.GraphElementFilter
Tests if a specified graph element (node or edge) should be included in a graph element list.
accept(E) - Method in interface com.kuka.graph.traverse.GraphElementConsumer
Checks if a graph element is accepted by the consumer.
acceptAll() - Static method in class com.kuka.graph.GraphElementFilters
Returns a graph element filter accepting any element.
acceptAll(E...) - Static method in class com.kuka.graph.GraphElementFilters
Returns a graph element filter accepting any element contained in an array of given elements.
acceptAll(Collection<E>) - Static method in class com.kuka.graph.GraphElementFilters
Returns a graph element filter accepting any element contained in a collection of given elements.
acceptAllExcept(E...) - Static method in class com.kuka.graph.GraphElementFilters
Returns a graph element filter accepting any element except those contained in an array of given elements.
acceptAllExcept(Collection<E>) - Static method in class com.kuka.graph.GraphElementFilters
Returns a graph element filter accepting any element except those contained in a collection of given elements.
add(A, double) - Method in interface com.kuka.graph.traverse.AbstractBaseGraphIterator.NodeQueue
Adds the given node to this queue.
add(E) - Method in class com.kuka.graph.util.PairingHeap
 
add(E) - Method in interface com.kuka.graph.util.PriorityQueue
Adds an element to this priority queue, maintaining heap order.
addAllEdges(Collection<E>) - Method in interface com.kuka.graph.Graph
Adds all of the edges in the specified collection to this graph if they are not already present (optional operation).
addAllEdges(Collection<E>) - Method in class com.kuka.graph.impl.AbstractGraph
 
addAllNodes(Collection<N>) - Method in interface com.kuka.graph.Graph
Adds all of the nodes in the specified collection to this graph if they are not already present (optional operation).
addAllNodes(Collection<N>) - Method in class com.kuka.graph.impl.AbstractGraph
 
addEdge(E) - Method in interface com.kuka.graph.Graph
Adds the specified edge to this graph if it is not already present (optional operation).
addEdge(E) - Method in class com.kuka.graph.GraphBuilder
Adds the specified edge to the graph if it is not already present.
addEdge(N, N) - Method in class com.kuka.graph.GraphBuilder
Adds an edge from the specified source to the specified target node to the graph if it is not already present.
addEdge(E) - Method in class com.kuka.graph.impl.AbstractBaseGraph
 
addEdge(E) - Method in class com.kuka.graph.impl.AbstractBaseListenableGraph
 
addEdge(E) - Method in class com.kuka.graph.impl.BasePath
 
addEdge(E) - Method in class com.kuka.graph.impl.FastUncheckedGraph
 
addEdge(E) - Method in class com.kuka.graph.impl.FastUncheckedPath
 
addEdge(E) - Method in class com.kuka.graph.impl.Subgraph
 
addEdge(E) - Method in class com.kuka.graph.impl.TransposeGraph
 
addGraph(G) - Method in class com.kuka.graph.GraphBuilder
Adds all nodes and edges contained in the specified graph if they are not already present.
addGraph(Graph<N, E>, Graph<N, E>) - Static method in class com.kuka.graph.Graphs
Adds all nodes and edges in the source graph to the destination graph if they are not already present.
addListener(GraphListener<N, E>) - Method in class com.kuka.graph.impl.AbstractBaseListenableGraph
 
addListener(GraphListener<N, E>) - Method in interface com.kuka.graph.ListenableGraph
Adds the specified graph listener.
addNode(N) - Method in interface com.kuka.graph.Graph
Adds the specified node to this graph if it is not already present (optional operation).
addNode(N) - Method in class com.kuka.graph.GraphBuilder
Adds the specified node to the graph if it is not already present.
addNode(N) - Method in class com.kuka.graph.impl.AbstractBaseGraph
 
addNode(N) - Method in class com.kuka.graph.impl.AbstractBaseListenableGraph
 
addNode(N) - Method in class com.kuka.graph.impl.BasePath
 
addNode(N) - Method in class com.kuka.graph.impl.FastUncheckedGraph
 
addNode(N) - Method in class com.kuka.graph.impl.Subgraph
 
addNode(N) - Method in class com.kuka.graph.impl.TransposeGraph
 
ArraySetUnenforced<T> - Class in com.kuka.graph.util
Helper for efficiently representing small sets whose elements are known to be unique by construction, implying we don't need to enforce the uniqueness property in the data structure itself.
ArraySetUnenforced() - Constructor for class com.kuka.graph.util.ArraySetUnenforced
Constructs an empty set with an initial capacity of ten.
ArraySetUnenforced(Collection<? extends T>) - Constructor for class com.kuka.graph.util.ArraySetUnenforced
Constructs a set containing the elements of the specified collection.
ArraySetUnenforced(int) - Constructor for class com.kuka.graph.util.ArraySetUnenforced
Constructs an empty set with the specified initial capacity.
AStar<N,E extends Edge<N>> - Class in com.kuka.graph.alg
Implementation of the A* path finding algorithm.
AStar(Graph<N, E>, CostFunction<N, E>, N, N) - Constructor for class com.kuka.graph.alg.AStar
Instantiates a new A*.
AStar(Graph<N, E>, CostFunction<N, E>, N, N, GraphElementFilter<N>) - Constructor for class com.kuka.graph.alg.AStar
Instantiates a new A*.
AStar(Graph<N, E>, CostFunction<N, E>, N, N, GraphElementFilter<N>, GraphElementFilter<Edge<N>>) - Constructor for class com.kuka.graph.alg.AStar
Instantiates a new A*.

B

BasePath<N,E extends Edge<N>> - Class in com.kuka.graph.impl
Class realizing a path in a directed graph.
BasePath(Graph<N, E>) - Constructor for class com.kuka.graph.impl.BasePath
Constructor.
BreadthFirstIterator<N> - Class in com.kuka.graph.traverse
A breadth first iterator.
BreadthFirstIterator(Graph<N, ?>, N) - Constructor for class com.kuka.graph.traverse.BreadthFirstIterator
Creates a new breadth first iterator starting at the given node and expanding all nodes of the graph.
build() - Method in class com.kuka.graph.GraphBuilder
Builds the graph.

C

clear() - Method in interface com.kuka.graph.Graph
Removes all nodes and all edges from this graph (optional operation).
clear() - Method in class com.kuka.graph.impl.AbstractGraph
 
clear() - Method in class com.kuka.graph.util.PairingHeap
 
clear() - Method in interface com.kuka.graph.util.PriorityQueue
Removes all of the elements from this priority queue.
clone() - Method in class com.kuka.graph.impl.AbstractBaseGraph
 
ClosestFirstIterator<N> - Class in com.kuka.graph.traverse
A closest first iterator.
ClosestFirstIterator(Graph<N, ?>, CostFunction<N, ?>, N) - Constructor for class com.kuka.graph.traverse.ClosestFirstIterator
Creates a new closest first iterator starting at the given node and expanding all nodes of the graph.
ClosestFirstIterator(Graph<N, ?>, CostFunction<N, ?>, N, N) - Constructor for class com.kuka.graph.traverse.ClosestFirstIterator
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.
com.kuka.graph - package com.kuka.graph
This package contains the main interfaces and utility classes for working with graphs.
com.kuka.graph.alg - package com.kuka.graph.alg
This package contains graph algorithms.
com.kuka.graph.cost - package com.kuka.graph.cost
This package contains the base classes and interfaces for cost functions used by graph algorithms.
com.kuka.graph.event - package com.kuka.graph.event
This package contains classes and interfaces for graph listeners.
com.kuka.graph.generate - package com.kuka.graph.generate
This package contains helper classes for generating graphs.
com.kuka.graph.impl - package com.kuka.graph.impl
This package contains the base implementations of the graph and edge interface.
com.kuka.graph.traverse - package com.kuka.graph.traverse
This package contains classes for graph traversal.
com.kuka.graph.util - package com.kuka.graph.util
This package contains common helper classes for working with graphs.
concat(Path<N, E>) - Method in class com.kuka.graph.impl.BasePath
 
concat(Path<N, E>) - Method in class com.kuka.graph.impl.FastUncheckedPath
 
concat(Path<N, E>) - Method in interface com.kuka.graph.Path
Concatenates the specified path to the end of this path.
constant(double) - Static method in class com.kuka.graph.cost.CostFunctions
Cost function unconditionally returning the specified weight.
containsAllEdges(Collection<E>) - Method in interface com.kuka.graph.Graph
Returns true if this graph contains all of the edges of the specified collection.
containsAllEdges(Collection<E>) - Method in class com.kuka.graph.impl.AbstractGraph
 
containsAllNodes(Collection<N>) - Method in interface com.kuka.graph.Graph
Returns true if this graph contains all of the nodes of the specified collection.
containsAllNodes(Collection<N>) - Method in class com.kuka.graph.impl.AbstractGraph
 
containsEdge(E) - Method in interface com.kuka.graph.Graph
Returns true if this graph contains the specified edge.
containsEdge(N, N) - Method in interface com.kuka.graph.Graph
Returns true if this graph contains the specified edge e=(source,target).
containsEdge(E) - Method in class com.kuka.graph.impl.AbstractBaseGraph
 
containsEdge(N, N) - Method in class com.kuka.graph.impl.AbstractGraph
 
containsEdge(E) - Method in class com.kuka.graph.impl.FastUncheckedGraph
 
containsEdge(E) - Method in class com.kuka.graph.impl.TransposeGraph
 
containsNode(N) - Method in interface com.kuka.graph.Graph
Returns true if this graph contains the specified node.
containsNode(N) - Method in class com.kuka.graph.impl.AbstractBaseGraph
 
containsNode(N) - Method in class com.kuka.graph.impl.FastUncheckedGraph
 
containsNode(N) - Method in class com.kuka.graph.impl.TransposeGraph
 
cost(N) - Method in class com.kuka.graph.alg.Dijkstra
 
CostFunction<N,E> - Interface in com.kuka.graph.cost
Interface for cost functions allowing for evaluation and estimation of costs of moving in a graph.
CostFunctions - Class in com.kuka.graph.cost
A collection of predefined cost filter implementations.
create(G) - Static method in class com.kuka.graph.GraphBuilder
Creates a new graph builder for the given graph.
createEdge(N, N) - Method in interface com.kuka.graph.EdgeFactory
Creates a new edge from the specified source node to the target node and returns the created edge.
createEdge(N, N) - Method in interface com.kuka.graph.Graph
Creates a new edge from the specified source node to the target node, adds it to this graph and returns the created edge.
createEdge(N, N) - Method in class com.kuka.graph.impl.DefaultEdgeFactory
 
createEdge(N, N) - Method in class com.kuka.graph.impl.DefaultGraph
 
createEdge(N, N) - Method in class com.kuka.graph.impl.FastUncheckedGraph
 
createEdge(N, N) - Method in class com.kuka.graph.impl.FastUncheckedPath
 
createEdge(N, N) - Method in class com.kuka.graph.impl.Subgraph
 
createEdge(N, N) - Method in class com.kuka.graph.impl.TransposeGraph
 
createNode() - Method in interface com.kuka.graph.Graph
Creates a new node, adds it to this graph and returns the created node.
createNode() - Method in class com.kuka.graph.impl.DefaultGraph
 
createNode() - Method in class com.kuka.graph.impl.FastUncheckedGraph
 
createNode() - Method in class com.kuka.graph.impl.FastUncheckedPath
 
createNode() - Method in class com.kuka.graph.impl.Subgraph
 
createNode() - Method in class com.kuka.graph.impl.TransposeGraph
 
createNode() - Method in interface com.kuka.graph.NodeFactory
Creates a new node.

D

decreaseKey(FibonacciHeap.Handle<K, T>, K) - Method in class com.kuka.graph.util.FibonacciHeap
Decreases the priority of an element that is already in the heap.
decreaseKey(PriorityQueue.Handle<E>, E) - Method in class com.kuka.graph.util.PairingHeap
 
decreaseKey(PriorityQueue.Handle<E>, E) - Method in interface com.kuka.graph.util.PriorityQueue
Changes the value of the item stored in the pairing heap (optional operation).
DefaultEdge<N> - Class in com.kuka.graph.impl
Simple realization of a directed edge.
DefaultEdge(N, N) - Constructor for class com.kuka.graph.impl.DefaultEdge
Constructor.
DefaultEdgeFactory<N> - Class in com.kuka.graph.impl
Edge factory implementation creating instances of DefaultEdge.
DefaultEdgeFactory() - Constructor for class com.kuka.graph.impl.DefaultEdgeFactory
 
DefaultGraph<N> - Class in com.kuka.graph.impl
Simple realization of a directed graph.
DefaultGraph() - Constructor for class com.kuka.graph.impl.DefaultGraph
Default constructor with no node factory set.
DefaultGraph(NodeFactory<N>) - Constructor for class com.kuka.graph.impl.DefaultGraph
Constructor.
DepthFirstIterator<N> - Class in com.kuka.graph.traverse
A depth first iterator.
DepthFirstIterator(Graph<N, ?>, N) - Constructor for class com.kuka.graph.traverse.DepthFirstIterator
Creates a new depth first iterator starting at the given node and expanding all nodes of the graph.
Dijkstra<N,E extends Edge<N>> - Class in com.kuka.graph.alg
Implements a basic Dijkstra algorithm.
Dijkstra(Graph<N, E>, CostFunction<N, E>, N) - Constructor for class com.kuka.graph.alg.Dijkstra
Executes the dijkstra algorithm.
Dijkstra(Graph<N, E>, CostFunction<N, E>, N, GraphElementFilter<N>) - Constructor for class com.kuka.graph.alg.Dijkstra
Executes the dijkstra algorithm.
Dijkstra(Graph<N, E>, CostFunction<N, E>, N, N) - Constructor for class com.kuka.graph.alg.Dijkstra
Executes the dijkstra algorithm.
Dijkstra(Graph<N, E>, CostFunction<N, E>, N, N, GraphElementFilter<N>) - Constructor for class com.kuka.graph.alg.Dijkstra
Executes the dijkstra algorithm.
Dijkstra(Graph<N, E>, CostFunction<N, E>, N, Set<N>, GraphElementFilter<N>) - Constructor for class com.kuka.graph.alg.Dijkstra
Executes the dijkstra algorithm.
Dijkstra(Graph<N, E>, CostFunction<N, E>, N, Set<N>) - Constructor for class com.kuka.graph.alg.Dijkstra
Executes the dijkstra algorithm.
Dijkstra(Graph<N, E>, CostFunction<N, E>, N, Set<N>, Dijkstra.GoalMode, GraphElementFilter<Edge<N>>) - Constructor for class com.kuka.graph.alg.Dijkstra
Executes the dijkstra algorithm.
Dijkstra(Graph<N, E>, CostFunction<N, E>, N, Set<N>, Dijkstra.GoalMode, GraphElementFilter<N>, GraphElementFilter<Edge<N>>) - Constructor for class com.kuka.graph.alg.Dijkstra
Executes the dijkstra algorithm.
Dijkstra.GoalMode - Enum in com.kuka.graph.alg
Specifies the termination of the algorithm.

E

Edge<N> - Interface in com.kuka.graph
This interface models an element of the edge E set of a graph G=(N,E).
edgeAdded(E) - Method in interface com.kuka.graph.event.GraphListener
Called when an edge has been added to the graph.
edgeAdded(E) - Method in class com.kuka.graph.event.GraphNodeSetListener
 
EdgeFactory<N,E> - Interface in com.kuka.graph
Factory for creating edges.
EdgeIterator<N,E> - Class in com.kuka.graph.traverse
Class providing methods to iterate over the edges of a Path.
EdgeIterator(Graph<N, E>, Iterator<N>) - Constructor for class com.kuka.graph.traverse.EdgeIterator
Constructor.
edgeRemoved(E) - Method in interface com.kuka.graph.event.GraphListener
Called when an edge has been removed from the graph.
edgeRemoved(E) - Method in class com.kuka.graph.event.GraphNodeSetListener
 
edges() - Method in interface com.kuka.graph.Graph
Returns an unmodifiable Set view of the edges contained in this graph.
edges(GraphElementFilter<? super E>) - Method in interface com.kuka.graph.Graph
Returns an unmodifiable Set view of the edges contained in this graph that satisfy the specified filter.
edges() - Method in class com.kuka.graph.impl.AbstractBaseGraph
 
edges(GraphElementFilter<? super E>) - Method in class com.kuka.graph.impl.AbstractGraph
 
edges() - Method in class com.kuka.graph.impl.FastUncheckedGraph
 
edges() - Method in class com.kuka.graph.impl.TransposeGraph
 
edgeSize() - Method in interface com.kuka.graph.Graph
Returns the number of edges in this graph, i.e. the cardinality of the set of edges.
edgeSize() - Method in class com.kuka.graph.impl.AbstractGraph
 
emptyGraph() - Static method in class com.kuka.graph.Graphs
Returns the empty graph (immutable).
emptyPath() - Static method in class com.kuka.graph.Graphs
Returns the empty path (immutable).
equals(Object) - Method in class com.kuka.graph.util.ArraySetUnenforced
 
estimate(N, N) - Method in class com.kuka.graph.cost.AbstractBaseCostFunction
 
estimate(N, N) - Method in interface com.kuka.graph.cost.CostFunction
Estimate the cost of going from source to target.
evaluate(E) - Method in class com.kuka.graph.cost.AbstractBaseCostFunction
 
evaluate(Path<N, E>) - Method in class com.kuka.graph.cost.AbstractBaseCostFunction
 
evaluate(E) - Method in interface com.kuka.graph.cost.CostFunction
Evaluate the cost of an edge.
evaluate(N, N) - Method in interface com.kuka.graph.cost.CostFunction
Evaluate the cost of going from source to target.
evaluate(Path<N, E>) - Method in interface com.kuka.graph.cost.CostFunction
Evaluate the cost of a path.

F

FastUncheckedGraph<N,E extends Edge<N>> - Class in com.kuka.graph.impl
Implements a graph as incidence map.
FastUncheckedGraph(NodeFactory<N>, EdgeFactory<N, E>) - Constructor for class com.kuka.graph.impl.FastUncheckedGraph
Constructor.
FastUncheckedPath<N,E extends Edge<N>> - Class in com.kuka.graph.impl
Implements a path.
FastUncheckedPath() - Constructor for class com.kuka.graph.impl.FastUncheckedPath
 
FibonacciHeap<K extends Comparable<K>,T> - Class in com.kuka.graph.util
This Fibonacci heap is a special implementation of a priority queue tailored for graph search algorithms.
FibonacciHeap() - Constructor for class com.kuka.graph.util.FibonacciHeap
 
FibonacciHeap.Handle<C,V> - Class in com.kuka.graph.util
Handle to elements in the heap for efficient access.
findMin() - Method in class com.kuka.graph.util.PairingHeap
 
findMin() - Method in interface com.kuka.graph.util.PriorityQueue
Finds and returns the item with the lowest priority in this queue.
firstNode() - Method in class com.kuka.graph.impl.BasePath
 
firstNode() - Method in class com.kuka.graph.impl.FastUncheckedPath
 
firstNode() - Method in interface com.kuka.graph.Path
Returns the first node of this path.
forEach(GraphElementConsumer<? super E>) - Method in class com.kuka.graph.traverse.IterableGraphElements
Iterates over the elements and checks for each element whether it is accepted by GraphElementConsumer.accept(Object) of the given element consumer.

G

get() - Method in interface com.kuka.graph.util.PriorityQueue.Handle
Returns the value of the corresponding element.
getClosestGoal() - Method in class com.kuka.graph.alg.Dijkstra
 
getCol() - Method in class com.kuka.graph.generate.GridGraphGenerator.Coordinate
Returns the column.
getCoord(N) - Method in class com.kuka.graph.generate.GridGraphGenerator
Returns the coordinate of the given node in the grid graph, i.e. the row and column of the node.
getCost(N) - Method in class com.kuka.graph.alg.RRAStar
Returns the cost of the optimal path from the given node to the goal node specified in the constructor.
getCost() - Method in class com.kuka.graph.traverse.AbstractBaseGraphIterator
 
getCost(N) - Method in class com.kuka.graph.traverse.AbstractBaseGraphIterator
 
getCost() - Method in interface com.kuka.graph.traverse.GraphIterator
 
getCost(N) - Method in interface com.kuka.graph.traverse.GraphIterator
Returns the cost of the given node.
getEdge(N, N) - Method in interface com.kuka.graph.Graph
Returns the edge e=(source,target) from the specified source node to the target node, or null if this graph contains no such edge.
getEdge(N, N) - Method in class com.kuka.graph.impl.AbstractBaseGraph
 
getEdge(N, N) - Method in class com.kuka.graph.impl.FastUncheckedGraph
 
getEdge(N, N) - Method in class com.kuka.graph.impl.TransposeGraph
 
getGoals() - Method in class com.kuka.graph.alg.Dijkstra
 
getNode(int, int) - Method in class com.kuka.graph.generate.GridGraphGenerator
Get the node that has the given coordinates in the grid.
getPredecessor() - Method in class com.kuka.graph.traverse.AbstractBaseGraphIterator
 
getPredecessor(N) - Method in class com.kuka.graph.traverse.AbstractBaseGraphIterator
 
getPredecessor() - Method in interface com.kuka.graph.traverse.GraphIterator
Returns the predecessor node of this graph iterator.
getPredecessor(N) - Method in interface com.kuka.graph.traverse.GraphIterator
Returns the predecessor node of a certain node of this graph iterator.
getRow() - Method in class com.kuka.graph.generate.GridGraphGenerator.Coordinate
Returns the row.
getShortestPath() - Method in class com.kuka.graph.alg.AStar
Determines the shortest path, i.e. the path with minimum overall cost from start to goal.
getShortestPath(N) - Method in class com.kuka.graph.alg.Dijkstra
Determines the shortest path to goal, i.e. the path with minimum overall cost from start to goal.
getSource() - Method in interface com.kuka.graph.Edge
Returns the source node of this edge.
getSource() - Method in class com.kuka.graph.impl.DefaultEdge
 
getSuccessor(N) - Method in class com.kuka.graph.alg.RRAStar
Returns the successor of the given node in the optimal path to the goal node specified in the constructor.
getTarget() - Method in interface com.kuka.graph.Edge
Returns the target node of this edge.
getTarget() - Method in class com.kuka.graph.impl.DefaultEdge
 
Graph<N,E> - Interface in com.kuka.graph
As implied by its name, this interface models the mathematical graph abstraction.
graph() - Method in class com.kuka.graph.impl.Subgraph
 
GraphBuilder<N,E,G extends Graph<N,E>> - Class in com.kuka.graph
Helper class for building graphs.
GraphEdgeSetListener<N,E> - Class in com.kuka.graph.event
Abstract super class for edge listeners.
GraphEdgeSetListener() - Constructor for class com.kuka.graph.event.GraphEdgeSetListener
 
GraphElementConsumer<E> - Interface in com.kuka.graph.traverse
The graph element consumer interface for filtering graph elements.
GraphElementFilter<E> - Interface in com.kuka.graph
Instances of classes that implement this interface are used to filter the node or edge set of a graph.
GraphElementFilters - Class in com.kuka.graph
A collection of default graph element filter implementations.
GraphIterator<T extends GraphIterator<T,N>,N> - Interface in com.kuka.graph.traverse
Iterator interface for graph traversal.
GraphListener<N,E> - Interface in com.kuka.graph.event
Listener interface to be implemented to obtain notifications about changes in a graph.
GraphNodeSetListener<N,E> - Class in com.kuka.graph.event
Abstract super class for node listeners.
GraphNodeSetListener() - Constructor for class com.kuka.graph.event.GraphNodeSetListener
 
Graphs - Class in com.kuka.graph
Contains helper methods for working with graphs.
GraphTraversal - Class in com.kuka.graph.traverse
Helper class to traverse a graph.
GridGraphGenerator<N,E> - Class in com.kuka.graph.generate
Generates a grid graph where every node is connected to each of its neighbouring nodes in the grid.
GridGraphGenerator(Graph<N, E>, int, int) - Constructor for class com.kuka.graph.generate.GridGraphGenerator
Constructor.
GridGraphGenerator.Coordinate - Class in com.kuka.graph.generate
Represents the coordinate of a node in the grid graph, i.e. the row and column of the node.

H

hashCode() - Method in class com.kuka.graph.util.ArraySetUnenforced
 
hasListeners() - Method in class com.kuka.graph.impl.AbstractBaseListenableGraph
 
hasListeners() - Method in interface com.kuka.graph.ListenableGraph
Indicates whether this graph contains any listeners.
hasNext() - Method in class com.kuka.graph.traverse.AbstractBaseGraphIterator
 
hasNext() - Method in class com.kuka.graph.traverse.EdgeIterator
 

I

incomingEdges(N) - Method in interface com.kuka.graph.Graph
Returns the set of all incoming edges of the specified node.
incomingEdges(N) - Method in class com.kuka.graph.impl.AbstractBaseGraph
 
incomingEdges(N) - Method in class com.kuka.graph.impl.FastUncheckedGraph
 
incomingEdges(N) - Method in class com.kuka.graph.impl.TransposeGraph
 
insert(K, T) - Method in class com.kuka.graph.util.FibonacciHeap
Inserts an element into the heap.
isEmpty() - Method in interface com.kuka.graph.Graph
Returns true if this graph contains no elements.
isEmpty() - Method in class com.kuka.graph.impl.AbstractGraph
 
isEmpty() - Method in interface com.kuka.graph.traverse.AbstractBaseGraphIterator.NodeQueue
 
isEmpty() - Method in class com.kuka.graph.util.FibonacciHeap
Returns true if this heap contains no elements.
isEmpty() - Method in class com.kuka.graph.util.PairingHeap
 
isEmpty() - Method in interface com.kuka.graph.util.PriorityQueue
Returns true if this priority queue contains no elements.
isValid() - Method in class com.kuka.graph.util.FibonacciHeap.Handle
 
isValid() - Method in interface com.kuka.graph.util.PriorityQueue.Handle
Returns true if this handle is valid.
IterableGraphElements<E> - Class in com.kuka.graph.traverse
Class allowing for iteration over elements of a graph.
iterator() - Method in class com.kuka.graph.impl.AbstractGraph
 
iterator() - Method in class com.kuka.graph.impl.BasePath
 
iterator() - Method in class com.kuka.graph.impl.FastUncheckedPath
 
iterator() - Method in class com.kuka.graph.traverse.IterableGraphElements
 

L

lastNode() - Method in class com.kuka.graph.impl.BasePath
 
lastNode() - Method in class com.kuka.graph.impl.FastUncheckedPath
 
lastNode() - Method in interface com.kuka.graph.Path
Returns the last node of this path.
ListenableGraph<N,E> - Interface in com.kuka.graph
A graph that supports listeners on structural change events.

N

neighbors(N) - Method in interface com.kuka.graph.Graph
Returns the set of all neighbors of the specified node.
neighbors(N) - Method in class com.kuka.graph.impl.AbstractBaseGraph
 
neighbors(N) - Method in class com.kuka.graph.impl.FastUncheckedGraph
 
neighbors(N) - Method in class com.kuka.graph.impl.TransposeGraph
Returns the set of all neighbors of the specified node.
next() - Method in class com.kuka.graph.traverse.AbstractBaseGraphIterator
 
next() - Method in class com.kuka.graph.traverse.EdgeIterator
 
nodeAdded(N) - Method in class com.kuka.graph.event.GraphEdgeSetListener
 
nodeAdded(N) - Method in interface com.kuka.graph.event.GraphListener
Called when a node has been added to the graph.
NodeFactory<N> - Interface in com.kuka.graph
Factory creating nodes of type N.
nodeRemoved(N) - Method in class com.kuka.graph.event.GraphEdgeSetListener
 
nodeRemoved(N) - Method in interface com.kuka.graph.event.GraphListener
Called when a node has been removed from the graph.
nodes() - Method in interface com.kuka.graph.Graph
Returns an unmodifiable Set view of the nodes contained in this graph.
nodes(GraphElementFilter<? super N>) - Method in interface com.kuka.graph.Graph
Returns an unmodifiable Set view of the nodes contained in this graph that satisfy the specified filter.
nodes() - Method in class com.kuka.graph.impl.AbstractBaseGraph
 
nodes(GraphElementFilter<? super N>) - Method in class com.kuka.graph.impl.AbstractGraph
 
nodes() - Method in class com.kuka.graph.impl.FastUncheckedGraph
 
nodes() - Method in class com.kuka.graph.impl.TransposeGraph
 
nodeSize() - Method in interface com.kuka.graph.Graph
Returns the number of nodes in this graph, i.e. the cardinality of the set of nodes.
nodeSize() - Method in class com.kuka.graph.impl.AbstractGraph
 

O

one() - Static method in class com.kuka.graph.cost.CostFunctions
Cost function unconditionally returning the weight 1.
outgoingEdges(N) - Method in interface com.kuka.graph.Graph
Returns the set of all outgoing edges of the specified node.
outgoingEdges(N) - Method in class com.kuka.graph.impl.AbstractBaseGraph
 
outgoingEdges(N) - Method in class com.kuka.graph.impl.FastUncheckedGraph
 
outgoingEdges(N) - Method in class com.kuka.graph.impl.TransposeGraph
 

P

PairingHeap<E> - Class in com.kuka.graph.util
Implements a pairing heap.
PairingHeap() - Constructor for class com.kuka.graph.util.PairingHeap
Creates a PairingHeap that orders its elements according to their natural ordering.
PairingHeap(Comparator<? super E>) - Constructor for class com.kuka.graph.util.PairingHeap
Creates a PairingHeap that orders its elements according to the specified comparator.
Path<N,E> - Interface in com.kuka.graph
Represents a path in a graph G=(N,E).
PriorityQueue<E> - Interface in com.kuka.graph.util
This priority queue interface is tailored for graph search algorithms.
PriorityQueue.Handle<T> - Interface in com.kuka.graph.util
Handle to elements in a priority queue for efficient access.

R

remove() - Method in interface com.kuka.graph.traverse.AbstractBaseGraphIterator.NodeQueue
Removes the first node in the queue.
remove() - Method in class com.kuka.graph.traverse.AbstractBaseGraphIterator
 
remove() - Method in class com.kuka.graph.traverse.EdgeIterator
 
removeAllEdges(Collection<E>) - Method in interface com.kuka.graph.Graph
Removes from this graph all of its edges that are contained in the specified collection (optional operation).
removeAllEdges(Collection<E>) - Method in class com.kuka.graph.impl.AbstractGraph
 
removeAllNodes(Collection<N>) - Method in interface com.kuka.graph.Graph
Removes from this graph all of its nodes that are contained in the specified collection (optional operation).
removeAllNodes(Collection<N>) - Method in class com.kuka.graph.impl.AbstractGraph
 
removeEdge(E) - Method in interface com.kuka.graph.Graph
Removes the specified edge e from this graph if it is present (optional operation).
removeEdge(N, N) - Method in interface com.kuka.graph.Graph
Removes the edge e=(source,target) connecting the specified source and target node from this graph if it is present (optional operation).
removeEdge(E) - Method in class com.kuka.graph.impl.AbstractBaseGraph
 
removeEdge(E) - Method in class com.kuka.graph.impl.AbstractBaseListenableGraph
 
removeEdge(N, N) - Method in class com.kuka.graph.impl.AbstractGraph
 
removeEdge(E) - Method in class com.kuka.graph.impl.FastUncheckedGraph
 
removeEdge(E) - Method in class com.kuka.graph.impl.TransposeGraph
 
removeFirstNode() - Method in class com.kuka.graph.impl.BasePath
 
removeFirstNode() - Method in class com.kuka.graph.impl.FastUncheckedPath
 
removeFirstNode() - Method in interface com.kuka.graph.Path
Removes the first node (and edge to second node) from this path (optional operation).
removeLastNode() - Method in class com.kuka.graph.impl.BasePath
 
removeLastNode() - Method in class com.kuka.graph.impl.FastUncheckedPath
 
removeLastNode() - Method in interface com.kuka.graph.Path
Removes the last node (and edge to last node) from this path (optional operation).
removeListener(GraphListener<N, E>) - Method in class com.kuka.graph.impl.AbstractBaseListenableGraph
 
removeListener(GraphListener<N, E>) - Method in interface com.kuka.graph.ListenableGraph
Removes the specified listener.
removeMin() - Method in class com.kuka.graph.util.FibonacciHeap
Returns and removes the element with lowest priority.
removeMin() - Method in class com.kuka.graph.util.PairingHeap
 
removeMin() - Method in interface com.kuka.graph.util.PriorityQueue
Removes and returns the item with the lowest priority from this queue.
removeNode(N) - Method in interface com.kuka.graph.Graph
Removes the specified node n from this graph if it is present (optional operation).
removeNode(N) - Method in class com.kuka.graph.impl.AbstractBaseGraph
 
removeNode(N) - Method in class com.kuka.graph.impl.AbstractBaseListenableGraph
 
removeNode(N) - Method in class com.kuka.graph.impl.FastUncheckedGraph
 
removeNode(N) - Method in class com.kuka.graph.impl.TransposeGraph
 
retainAllEdges(Collection<E>) - Method in interface com.kuka.graph.Graph
Retains only the edges in this graph that are contained in the specified collection (optional operation).
retainAllEdges(Collection<E>) - Method in class com.kuka.graph.impl.AbstractGraph
 
retainAllNodes(Collection<N>) - Method in interface com.kuka.graph.Graph
Retains only the nodes in this graph that are contained in the specified collection (optional operation).
retainAllNodes(Collection<N>) - Method in class com.kuka.graph.impl.AbstractGraph
 
RRAStar<N> - Class in com.kuka.graph.alg
Implements the RRA* (Reverse Resumable A*) algorithm as described in Cooperative Pathfinding by David Silver.
RRAStar(Graph<N, ?>, CostFunction<N, ?>, N, N) - Constructor for class com.kuka.graph.alg.RRAStar
Creates a new RRA* algorithm instance.

S

self() - Method in class com.kuka.graph.traverse.AbstractBaseGraphIterator
 
setCost(CostFunction<N, ?>) - Method in class com.kuka.graph.traverse.AbstractBaseGraphIterator
 
setCost(CostFunction<N, ?>) - Method in interface com.kuka.graph.traverse.GraphIterator
Sets the cost function used for node expansions.
setEdgeFilter(GraphElementFilter<Edge<N>>) - Method in class com.kuka.graph.alg.RRAStar
Sets the filter specifying whether an edge may be traversed or must not be included in the path.
setEdgeFilter(GraphElementFilter<Edge<N>>) - Method in class com.kuka.graph.traverse.AbstractBaseGraphIterator
 
setEdgeFilter(GraphElementFilter<Edge<N>>) - Method in interface com.kuka.graph.traverse.GraphIterator
Sets an edge filter for this node iterator.
setNodeFilter(GraphElementFilter<N>) - Method in class com.kuka.graph.alg.RRAStar
Sets the filter specifying whether a node may be traversed or must not be included in the path.
setNodeFilter(GraphElementFilter<N>) - Method in class com.kuka.graph.traverse.AbstractBaseGraphIterator
 
setNodeFilter(GraphElementFilter<N>) - Method in interface com.kuka.graph.traverse.GraphIterator
Sets a node filter for this node iterator.
size() - Method in class com.kuka.graph.util.PairingHeap
 
size() - Method in interface com.kuka.graph.util.PriorityQueue
Returns the number of elements in this priority queue.
Subgraph<N,E extends Edge<N>> - Class in com.kuka.graph.impl
Class realizing a subgraph of a directed graph.
Subgraph(Graph<N, E>) - Constructor for class com.kuka.graph.impl.Subgraph
Constructor.

T

toString() - Method in class com.kuka.graph.impl.AbstractGraph
 
toString() - Method in class com.kuka.graph.impl.DefaultEdge
 
toString() - Method in class com.kuka.graph.util.FibonacciHeap
 
TransposeGraph<N,E extends Edge<N>> - Class in com.kuka.graph.impl
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.
TransposeGraph(Graph<N, E>) - Constructor for class com.kuka.graph.impl.TransposeGraph
Creates a transposed view of the given graph.

U

unmodifiableGraph(Graph<N, E>) - Static method in class com.kuka.graph.Graphs
Returns an unmodifiable view of the specified graph.
update(A, double) - Method in interface com.kuka.graph.traverse.AbstractBaseGraphIterator.NodeQueue
Updates the cost of the given node.

V

valueOf(String) - Static method in enum com.kuka.graph.alg.Dijkstra.GoalMode
Returns the enum constant of this type with the specified name.
values() - Static method in enum com.kuka.graph.alg.Dijkstra.GoalMode
Returns an array containing the constants of this enum type, in the order they are declared.

W

with(Iterator<E>) - Static method in class com.kuka.graph.traverse.GraphTraversal
Creates an iterable for iterating graph elements (nodes or edges) based on the given iterator.
with(Iterable<E>) - Static method in class com.kuka.graph.traverse.GraphTraversal
Creates an iterable for iterating graph elements (nodes or edges) based on the given iterable.

Z

zero() - Static method in class com.kuka.graph.cost.CostFunctions
Cost function unconditionally returning the weight 0.

A B C D E F G H I L N O P R S T U V W Z

Copyright © 2019. All rights reserved.