All Classes Interface Summary Class Summary Enum Summary Exception Summary
Class |
Description |
AbstractDirectedGraph<N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
|
AbstractDirectedGraphEdge<S extends AbstractDirectedGraphNode,T extends AbstractDirectedGraphNode> |
|
AbstractDirectedGraphNode |
|
AbstractDirectedHypergraph<N extends DirectedHypergraphNode,I extends DirectedIncomingHyperedge<? extends N,? extends N>,O extends DirectedOutgoingHyperedge<? extends N,? extends N>> |
|
AbstractDirectedHypergraphNode |
|
AbstractDirectedIncomingHyperedge<S extends AbstractDirectedHypergraphNode,T extends AbstractDirectedHypergraphNode> |
|
AbstractDirectedOutgoingHyperedge<S extends AbstractDirectedHypergraphNode,T extends AbstractDirectedHypergraphNode> |
|
AbstractGraph |
|
AbstractGraphEdge<S,T> |
|
AbstractGraphElement |
|
AbstractGraphNode |
|
AbstractShape |
|
AbstractUndirectedEdge<T extends UndirectedGraphNode> |
|
AbstractUndirectedGraph<N extends UndirectedGraphNode,E extends UndirectedGraphEdge<? extends N>> |
|
AbstractUndirectedNode |
|
AttributeMap |
|
AttributeMap.ArrowType |
|
AttributeMapOwner |
|
BoundaryDirectedGraphNode |
Interface to represent a node that can be drawn on the boundary of another
node (e.g.: an exception on a BPMN activity.) The other node will be a
ContainingDirectedGraphNode.
|
ComponentFactory |
|
ContainableDirectedGraphElement |
Interface to represent a directed graph element that can be the child of a
node.
|
ContainingDirectedGraphNode |
Interface to represent a directed graph node that contain other elements.
|
Decorated |
|
Diamond |
|
DirectedGraph<N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
|
DirectedGraphEdge<S extends DirectedGraphNode,T extends DirectedGraphNode> |
|
DirectedGraphEdge.MultipleSources<N extends DirectedGraphNode> |
Implementations of this class should also implement DirectedGraphEdge
|
DirectedGraphEdge.MultipleTargets<N extends DirectedGraphNode> |
Implementations of this class should also implement DirectedGraphEdge,
N>
|
DirectedGraphElement |
Main interface for elements of a directed graph.
|
DirectedGraphElementWeights |
|
DirectedGraphNode |
|
DirectedHypergraph<N extends DirectedHypergraphNode,I extends DirectedIncomingHyperedge<? extends N,? extends N>,O extends DirectedOutgoingHyperedge<? extends N,? extends N>> |
|
DirectedHypergraphElement |
|
DirectedHypergraphNode |
|
DirectedIncomingHyperedge<S extends DirectedHypergraphNode,T extends DirectedHypergraphNode> |
represents edges going from multiple sources towards one target
|
DirectedOutgoingHyperedge<S extends DirectedHypergraphNode,T extends DirectedHypergraphNode> |
represents edges going from a source towards multiple targets
|
EdgeID |
|
Ellipse |
|
ExecutionInformation |
|
Expandable |
|
ExpansionListener |
|
ExpansionListener.ListenerList |
|
ExtendedSemantics<S,T> |
|
Gate |
|
GraphIterator |
|
GraphIterator.EdgeAcceptor<N,E extends DirectedGraphEdge<? extends N,? extends N>> |
|
GraphIterator.NodeAcceptor<T extends DirectedGraphNode> |
|
GraphLayoutConnection |
|
GraphLayoutConnection.Listener |
|
Hexagon |
|
IllegalTransitionException |
|
Node<T> |
Represents a node of the Tree class.
|
NodeID |
|
Octagon |
|
Polygon |
|
Rectangle |
|
RoundedRect |
|
Semantics<S,T> |
|
Shape |
|
ShortestPathFactory |
This class generate a shortest path from one node in a directed graph to
another.
|
ShortestPathInfo<N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
|
UndirectedGraph<N extends UndirectedGraphNode,E extends UndirectedGraphEdge<? extends N>> |
|
UndirectedGraphEdge<T extends UndirectedGraphNode> |
|
UndirectedGraphElement |
|
UndirectedGraphNode |
|
ViewSpecificAttributeMap |
|