Uses of Interface
com.kuka.graph.Graph

Packages that use Graph

com.kuka.graph	This package contains the main interfaces and utility classes for working with graphs.
com.kuka.graph.alg	This package contains graph algorithms.
com.kuka.graph.generate	This package contains helper classes for generating graphs.
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 Graph in com.kuka.graph

Classes in com.kuka.graph with type parameters of type Graph

class

GraphBuilder<N,E,G extends Graph<N,E>> Helper class for building graphs.

Subinterfaces of Graph in com.kuka.graph

interface	ListenableGraph<N,E> A graph that supports listeners on structural change events.
interface	Path<N,E> Represents a path in a graph G=(N,E).

Methods in com.kuka.graph with type parameters of type Graph

static <N,E,G extends Graph<N,E>> GraphBuilder<N,E,G>

GraphBuilder.create(G graph) Creates a new graph builder for the given graph.

Methods in com.kuka.graph that return Graph

static <N,E> Graph<N,E>	Graphs.emptyGraph() Returns the empty graph (immutable).
static <N,E> Graph<N,E>	Graphs.unmodifiableGraph(Graph<N,E> graph) Returns an unmodifiable view of the specified graph.

Methods in com.kuka.graph with parameters of type Graph

static <N,E> boolean	Graphs.addGraph(Graph<N,E> destination, Graph<N,E> source) Adds all nodes and edges in the source graph to the destination graph if they are not already present.
static <N,E> boolean	Graphs.addGraph(Graph<N,E> destination, Graph<N,E> source) Adds all nodes and edges in the source graph to the destination graph if they are not already present.
static <N,E> Graph<N,E>	Graphs.unmodifiableGraph(Graph<N,E> graph) Returns an unmodifiable view of the specified graph.

Uses of Graph in com.kuka.graph.alg

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

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 Graph in com.kuka.graph.generate

Constructors in com.kuka.graph.generate with parameters of type Graph

GridGraphGenerator(Graph<N,E> graph, int rows, int cols)
Constructor.

Uses of Graph in com.kuka.graph.impl

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

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	AbstractGraph<N,E> Abstract superclass for all graphs, implementing base functionality common to all graphs.
class	BasePath<N,E extends Edge<N>> Class realizing a path in a directed graph.
class	DefaultGraph<N> Simple realization of 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.

Methods in com.kuka.graph.impl that return Graph

protected Graph<N,E>

Subgraph.graph()

Constructors in com.kuka.graph.impl with parameters of type Graph

BasePath(Graph<N,E> graph)
Constructor.

Subgraph(Graph<N,E> graph)
Constructor.

TransposeGraph(Graph<N,E> graph)
Creates a transposed view of the given graph.

Uses of Graph in com.kuka.graph.traverse

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

AbstractBaseGraphIterator(AbstractBaseGraphIterator.NodeQueue<N> queue, Graph<N,?> graph, N start)
Creates a new graph iterator.

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

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.

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

EdgeIterator(Graph<N,E> graph, Iterator<N> iter)
Constructor.