|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use AbstractGraph | |
|---|---|
| com.kuka.graph.impl | This package contains the base implementations of the graph and edge interface. |
| Uses of AbstractGraph in com.kuka.graph.impl |
|---|
| Subclasses of AbstractGraph in com.kuka.graph.impl | |
|---|---|
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 |
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. |
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||