| Package | Description |
|---|---|
| com.yworks.yfiles.algorithms | |
| com.yworks.yfiles.graph |
Definitions, default implementations, and support classes that represent graph structures and provide facilities for their programmatic modification.
|
| com.yworks.yfiles.layout |
Provides essential classes and interfaces that constitute the infrastructure for automatic graph layout generation.
|
| com.yworks.yfiles.layout.circular |
Provides circular layout style algorithms.
|
| com.yworks.yfiles.layout.genealogy |
Provides layout algorithms that are especially suited for genealogical family trees.
|
| com.yworks.yfiles.layout.hierarchic |
Provides hierarchic layout style algorithms.
|
| com.yworks.yfiles.layout.labeling |
Provides algorithms for the automatic placement of node and edge labels, so called generic labeling algorithms.
|
| com.yworks.yfiles.layout.multipage |
Provides the
MultiPageLayout that subdivides the input graph into several smaller graphs whose layouts fit the specified maximum page size. |
| com.yworks.yfiles.layout.organic |
Provides organic layout style algorithms that are based on a force-directed layout paradigm.
|
| com.yworks.yfiles.layout.orthogonal |
Provides orthogonal layout style algorithms.
|
| com.yworks.yfiles.layout.partial |
Provides class
PartialLayout that enables layout of user-specified, distinct parts of a diagram without altering the existing layout of the remainder of the diagram. |
| com.yworks.yfiles.layout.radial |
Provides the radial layout algorithm.
|
| com.yworks.yfiles.layout.router |
Provides classes for automatic routing of the edges in a graph.
|
| com.yworks.yfiles.layout.router.polyline |
Provides classes and interfaces for automatic polyline routing of the edges of a graph.
|
| com.yworks.yfiles.layout.seriesparallel |
Provides the series-parallel layout algorithm.
|
| com.yworks.yfiles.layout.tree |
Provides tree layout style algorithms.
|
| Class and Description |
|---|
| AbortHandler
This class provides a means for early termination of graph algorithms.
|
| AffineLine
This class represents a line in the 2D-dimensional affine space.
|
| BfsDirection |
| BorderLine
This class can be used to easily model an orthogonal border line or sky-line.
|
| BorderLine.Segment
The handle of a segment of a borderline.
|
| Dart
Represents a dart of a face of a
PlanarEmbedding. |
| DistanceMetric |
| DpKeyBase
This is the base class of all look-up keys that are used to register
IDataProvider with a Graph. |
| Edge |
| EdgeList
Specialized list implementation for instances of type
Edge. |
| Graph
This class implements a directed graph structure.
|
| GraphDpKey
This class is used as look-up key for registering
IDataProvider for the Graph itself with a graph. |
| GraphElementInsertion
Object insertion specifier.
|
| GraphEventType |
| GraphObject |
| Groups.Dendrogram
This class provides the result of hierarchical clustering algorithms by means of a binary tree structure.
|
| Groups.INodeDistanceProvider
An interface that determines the distance between two nodes of a graph.
|
| ICursor
A general interface for iterating over a collection of objects.
|
| IDataAcceptor
A general interface for setting data.
|
| IDataMap
Interface that combines the
IDataProvider and IDataAcceptor interfaces. |
| IDataProvider
A general interface for data provision.
|
| IEdgeCursor
A cursor interface for iterating over edges.
|
| IEdgeMap
Provides access to data associated with an edge.
|
| ILineSegmentCursor
This is an interface for a sequence of instances of LineSegment.
|
| INodeCursor
A cursor interface for iterating over nodes.
|
| INodeMap
Provides access to data associated with a node.
|
| IntersectionAlgorithm.IIntersectionHandler
An instance of this interface handles intersections found by the
IntersectionAlgorithm,. |
| IPlaneObject
This interface describes a 2-dimensional object which has a finite bounding box.
|
| IPointCursor
This is an interface for a sequence of instances of YPoint.
|
| LineSegment
This class represents a line segment in the plane.
|
| Linkage
A specifier for single-linkage clustering.
|
| ListCell
Represents a so-called "cell" or "link" of the doubly linked list implementation
YList. |
| Node
Represents a so-called node in the directed graph data type
Graph. |
| NodeList
Specialized list implementation for instances of type
Node. |
| Point2D
Represents a two-dimensional point located at
(x, y). |
| Rectangle2D
Represents a two-dimensional rectangle of size
(width x height), located at the point (x, y). |
| YDimension
This class represents the size of an object.
|
| YInsets
Double-precision immutable insets representation.
|
| YList
An implementation of a doubly linked list that provides direct access to the cells that store the elements.
|
| YOrientedRectangle
An oriented rectangle in 2D coordinate space with double precision coordinates.
|
| YPoint
This class represents a point in the plane with double coordinates.
|
| YPointPath
This class represents an ordered list of points in the plane.
|
| YRectangle
This class defines a rectangle and provides utility methods for it.
|
| YVector
This class represents a vector in the 2-dimensional real vector space.
|
| Class and Description |
|---|
| EdgeDpKey |
| ILabelLayoutDpKey |
| NodeDpKey |
| Class and Description |
|---|
| AbortHandler
This class provides a means for early termination of graph algorithms.
|
| DpKeyBase
This is the base class of all look-up keys that are used to register
IDataProvider with a Graph. |
| Edge |
| EdgeDpKey |
| EdgeList
Specialized list implementation for instances of type
Edge. |
| Graph
This class implements a directed graph structure.
|
| GraphDpKey
This class is used as look-up key for registering
IDataProvider for the Graph itself with a graph. |
| GraphObjectDpKey |
| ICursor
A general interface for iterating over a collection of objects.
|
| IDataAcceptor
A general interface for setting data.
|
| IDataMap
Interface that combines the
IDataProvider and IDataAcceptor interfaces. |
| IDataProvider
A general interface for data provision.
|
| IEdgeCursor
A cursor interface for iterating over edges.
|
| IEdgeLabelLayoutDpKey |
| IEdgeMap
Provides access to data associated with an edge.
|
| ILabelLayoutDpKey |
| INodeCursor
A cursor interface for iterating over nodes.
|
| INodeLabelLayoutDpKey |
| INodeMap
Provides access to data associated with a node.
|
| IPlaneObject
This interface describes a 2-dimensional object which has a finite bounding box.
|
| Node
Represents a so-called node in the directed graph data type
Graph. |
| NodeDpKey |
| NodeList
Specialized list implementation for instances of type
Node. |
| Rectangle2D
Represents a two-dimensional rectangle of size
(width x height), located at the point (x, y). |
| YDimension
This class represents the size of an object.
|
| YInsets
Double-precision immutable insets representation.
|
| YList
An implementation of a doubly linked list that provides direct access to the cells that store the elements.
|
| YOrientedRectangle
An oriented rectangle in 2D coordinate space with double precision coordinates.
|
| YPoint
This class represents a point in the plane with double coordinates.
|
| YPointPath
This class represents an ordered list of points in the plane.
|
| YRectangle
This class defines a rectangle and provides utility methods for it.
|
| YVector
This class represents a vector in the 2-dimensional real vector space.
|
| Class and Description |
|---|
| AbortHandler
This class provides a means for early termination of graph algorithms.
|
| INodeSequencer
This is a generic interface for classes that provide an ordering for the nodes of a graph.
|
| NodeDpKey |
| Class and Description |
|---|
| NodeDpKey |
| Class and Description |
|---|
| AbortHandler
This class provides a means for early termination of graph algorithms.
|
| BorderLine
This class can be used to easily model an orthogonal border line or sky-line.
|
| Edge |
| EdgeDpKey |
| EdgeList
Specialized list implementation for instances of type
Edge. |
| Graph
This class implements a directed graph structure.
|
| GraphDpKey
This class is used as look-up key for registering
IDataProvider for the Graph itself with a graph. |
| GraphObjectDpKey |
| IDataAcceptor
A general interface for setting data.
|
| IDataProvider
A general interface for data provision.
|
| INodeMap
Provides access to data associated with a node.
|
| ListCell
Represents a so-called "cell" or "link" of the doubly linked list implementation
YList. |
| Node
Represents a so-called node in the directed graph data type
Graph. |
| NodeDpKey |
| NodeList
Specialized list implementation for instances of type
Node. |
| Rectangle2D
Represents a two-dimensional rectangle of size
(width x height), located at the point (x, y). |
| YList
An implementation of a doubly linked list that provides direct access to the cells that store the elements.
|
| YPoint
This class represents a point in the plane with double coordinates.
|
| YPointPath
This class represents an ordered list of points in the plane.
|
| YRectangle
This class defines a rectangle and provides utility methods for it.
|
| Class and Description |
|---|
| AbortHandler
This class provides a means for early termination of graph algorithms.
|
| Edge |
| Graph
This class implements a directed graph structure.
|
| ILabelLayoutDpKey |
| INodeMap
Provides access to data associated with a node.
|
| LineSegment
This class represents a line segment in the plane.
|
| Node
Represents a so-called node in the directed graph data type
Graph. |
| YList
An implementation of a doubly linked list that provides direct access to the cells that store the elements.
|
| YRectangle
This class defines a rectangle and provides utility methods for it.
|
| Class and Description |
|---|
| AbortHandler
This class provides a means for early termination of graph algorithms.
|
| Edge |
| EdgeDpKey |
| IDataProvider
A general interface for data provision.
|
| IEdgeLabelLayoutDpKey |
| INodeLabelLayoutDpKey |
| Node
Represents a so-called node in the directed graph data type
Graph. |
| NodeDpKey |
| YDimension
This class represents the size of an object.
|
| YList
An implementation of a doubly linked list that provides direct access to the cells that store the elements.
|
| YRectangle
This class defines a rectangle and provides utility methods for it.
|
| Class and Description |
|---|
| AbortHandler
This class provides a means for early termination of graph algorithms.
|
| Edge |
| EdgeDpKey |
| Node
Represents a so-called node in the directed graph data type
Graph. |
| NodeDpKey |
| YPoint
This class represents a point in the plane with double coordinates.
|
| Class and Description |
|---|
| AbortHandler
This class provides a means for early termination of graph algorithms.
|
| EdgeDpKey |
| NodeDpKey |
| Class and Description |
|---|
| AbortHandler
This class provides a means for early termination of graph algorithms.
|
| EdgeDpKey |
| EdgeList
Specialized list implementation for instances of type
Edge. |
| NodeDpKey |
| NodeList
Specialized list implementation for instances of type
Node. |
| Class and Description |
|---|
| AbortHandler
This class provides a means for early termination of graph algorithms.
|
| NodeDpKey |
| YPoint
This class represents a point in the plane with double coordinates.
|
| Class and Description |
|---|
| AbortHandler
This class provides a means for early termination of graph algorithms.
|
| Edge |
| EdgeDpKey |
| EdgeList
Specialized list implementation for instances of type
Edge. |
| Graph
This class implements a directed graph structure.
|
| IDataAcceptor
A general interface for setting data.
|
| IDataProvider
A general interface for data provision.
|
| IEdgeCursor
A cursor interface for iterating over edges.
|
| YList
An implementation of a doubly linked list that provides direct access to the cells that store the elements.
|
| YPoint
This class represents a point in the plane with double coordinates.
|
| Class and Description |
|---|
| AbortHandler
This class provides a means for early termination of graph algorithms.
|
| Edge |
| EdgeDpKey |
| EdgeList
Specialized list implementation for instances of type
Edge. |
| Graph
This class implements a directed graph structure.
|
| IEdgeCursor
A cursor interface for iterating over edges.
|
| ILabelLayoutDpKey |
| LineSegment
This class represents a line segment in the plane.
|
| Node
Represents a so-called node in the directed graph data type
Graph. |
| YList
An implementation of a doubly linked list that provides direct access to the cells that store the elements.
|
| YPoint
This class represents a point in the plane with double coordinates.
|
| YRectangle
This class defines a rectangle and provides utility methods for it.
|
| Class and Description |
|---|
| AbortHandler
This class provides a means for early termination of graph algorithms.
|
| EdgeDpKey |
| Graph
This class implements a directed graph structure.
|
| IEdgeLabelLayoutDpKey |
| Node
Represents a so-called node in the directed graph data type
Graph. |
| NodeDpKey |
| Class and Description |
|---|
| AbortHandler
This class provides a means for early termination of graph algorithms.
|
| BorderLine
This class can be used to easily model an orthogonal border line or sky-line.
|
| Edge |
| EdgeDpKey |
| EdgeList
Specialized list implementation for instances of type
Edge. |
| IDataAcceptor
A general interface for setting data.
|
| IDataMap
Interface that combines the
IDataProvider and IDataAcceptor interfaces. |
| IDataProvider
A general interface for data provision.
|
| IEdgeMap
Provides access to data associated with an edge.
|
| INodeCursor
A cursor interface for iterating over nodes.
|
| Node
Represents a so-called node in the directed graph data type
Graph. |
| NodeDpKey |
| NodeList
Specialized list implementation for instances of type
Node. |
| Rectangle2D
Represents a two-dimensional rectangle of size
(width x height), located at the point (x, y). |
| YPoint
This class represents a point in the plane with double coordinates.
|