| Interface | Description |
|---|---|
| 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.
|
| INodeSequencer |
This is a generic interface for classes that provide an ordering for the nodes of a graph.
|
| 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.
|
| Class | 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.
|
| Bfs |
This class provides services that center around breadth first search (BFS).
|
| Bipartitions |
This class provides methods to determine whether a graph is bipartite and to obtain the corresponding partitions.
|
| 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.
|
| Centrality |
This class provides methods to determine various centrality indices of nodes or edges of a graph.
|
| Comparators |
This class provides access to some Comparator instances that are commonly used in yFiles.
|
| Cursors |
Provides utility methods for working with
cursors. |
| Cycles |
This class is responsible for finding cycles within a graph that have certain properties.
|
| Dart |
Represents a dart of a face of a
PlanarEmbedding. |
| DataProviderAdapter |
An abstract adapter class for providing data.
|
| DataProviders |
This class provides convenience and transformation services for DataProviders.
|
| DataProviders.DataProviderOverlayManager |
This helper class can be used to overlay DataProviders registered at a graph with another DataProvider.
|
| Dfs |
Framework class for implementing depth first search (DFS) based algorithms.
|
| DpKeyBase<TValue> |
This is the base class of all look-up keys that are used to register
IDataProvider with a Graph. |
| Edge | |
| EdgeDpKey<TValue> | |
| EdgeList |
Specialized list implementation for instances of type
Edge. |
| Geom |
This class provides useful geometric primitives and advanced geometric algorithms.
|
| Graph |
This class implements a directed graph structure.
|
| GraphChecker |
This class provides methods that check structural properties of a given graph.
|
| GraphConnectivity |
This class provides algorithms for determining certain connectivity components within a graph.
|
| GraphDpKey<TValue> |
This class is used as look-up key for registering
IDataProvider for the Graph itself with a graph. |
| GraphObject | |
| GraphObjectDpKey<TValue> | |
| GraphPartitionManager |
Provides functionality to hide and unhide partitions of nodes and their adjacent edges of a graph temporarily for
algorithmic operations.
|
| Groups |
This class provides methods for automatically partitioning nodes of a graph into groups.
|
| Groups.Dendrogram |
This class provides the result of hierarchical clustering algorithms by means of a binary tree structure.
|
| IEdgeLabelLayoutDpKey<TValue> | |
| ILabelLayoutDpKey<TValue> | |
| IndependentSets |
This class provides methods for calculating independent sets.
|
| INodeLabelLayoutDpKey<TValue> | |
| IntersectionAlgorithm |
This class calculates the intersection of rectangles in the plane with the help of a sweep-line algorithm.
|
| LayoutGraphHider |
Provides functionality to hide and unhide nodes and edges of a graph temporarily for algorithmic operations.
|
| LineSegment |
This class represents a line segment in the plane.
|
| ListCell |
Represents a so-called "cell" or "link" of the doubly linked list implementation
YList. |
| Maps |
This class provides convenience and transformation services for Node- and EdgeMaps.
|
| NetworkFlows |
This class provides sophisticated algorithms for solving classical network flow problems.
|
| Node |
Represents a so-called node in the directed graph data type
Graph. |
| NodeDpKey<TValue> | |
| NodeList |
Specialized list implementation for instances of type
Node. |
| NodeOrders |
This class provides algorithms that order the nodes of a graph using specific criteria.
|
| Paths |
This class provides methods for finding paths within a graph that have certain properties.
|
| PlanarEmbedding |
Represents an embedding of a planar graph.
|
| Point2D |
Represents a two-dimensional point located at
(x, y). |
| RankAssignments |
This class provides algorithms for solving the rank assignment problem.
|
| Rectangle2D |
Represents a two-dimensional rectangle of size
(width x height), located at the point (x, y). |
| ShortestPaths |
This class provides diverse algorithms and helper methods for solving the shortest path problem on weighted graphs.
|
| Sorting |
This class provides methods for efficiently sorting graph elements in graph structures.
|
| SpanningTrees |
This class provides (minimum) spanning tree algorithms for graphs.
|
| Transitivity |
This class provides algorithms to compute reachability information for directed, acyclic graphs.
|
| Trees |
This class provides diverse algorithms and services for tree-structured graphs or subgraphs.
|
| Triangulator |
This class provides algorithms for the triangulation of point sets in the plane.
|
| 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.
|
| Enum | Description |
|---|---|
| BfsDirection | |
| DistanceMetric | |
| GraphElementInsertion |
Object insertion specifier.
|
| GraphEventType | |
| Linkage |
A specifier for single-linkage clustering.
|
| Exception | Description |
|---|---|
| AlgorithmAbortedException |
Exception thrown by an algorithm to indicate that an immediate termination request was detected.
|
| InvalidGraphStructureException |
Exception thrown when a graph-structural precondition is violated.
|
Provides the yFiles library's most fundamental classes and interfaces that model an efficient graph data type (class Graph), its nodes and edges (classes Node and Edge), and related container structures and iteration mechanisms (class YList and interface ICursor).
Furthermore, this package also defines the infrastructure for association of additional data with graph elements, namely "data accessors," i.e., interfaces IDataAcceptor, IDataProvider, and IDataMap.