Implements a priority queue for nodes based on a array with bucket lists.

This class implements a priority queue for nodes whose priority values are of type double.

This class implements a priority queue for nodes whose priority values are of type int.

This class represents a priority queue for nodes where the priority values are of type Object The implementation is based on binary heaps.

This class provides access to some Comparator instances that are commonly used in yFiles.

This class contains only static methods, that can be used in conjunction with objects of type ICursor and IIterator .

An abstract adapter class for accepting data.

An abstract adapter class for providing data.

This class provides convenience and transformation services for DataProviders.

This helper class can be used to overlay DataProviders registered at a graph with another DataProvider.

This class implements a priority queue for objects whose priority values are of type double.

This class is an empty abstract implementation of the EdgeMap interface.

A utility class that can be used to copy a graph's structure and possibly associated data to another instance.

Abstract helper class that provides helper methods to copy DataProvider contents.

Helper class implementation of GraphCopier..::..ICopyFactory that can be used to copy the contents of a DataProvider registered with the source graph onto the target graph storing the values in newly a created CreateEdgeMap()()()() edge map}.

A helper wrapping implementation of the GraphCopier..::..ICopyFactory interface that copies the contents of the edge maps from the source to the target graph.

An abstract base implementation of a delegating CopyFactory that copies data for items being copied.

Helper class implementation of GraphCopier..::..ICopyFactory that can be used to copy the contents of a DataProvider registered with the source graph onto the target graph storing the values in newly created HashMap based IDataMap s.

Helper class implementation of GraphCopier..::..ICopyFactory that can be used to copy the contents of a DataProvider registered with the source graph onto the target graph storing the values in newly created node map .

A helper wrapping implementation of the GraphCopier..::..ICopyFactory interface that copies the contents of the node maps from the source to the target graph.

Provides functionality to hide and unhide nodes and edges of a graph temporarily for algorithmic operations.

Provides functionality to hide and unhide partitions of nodes and their adjacent edges of a graph temporarily for algorithmic operations.

This class implements a priority queue for objects whose priority values are of type int.

A specialized priority queue that contains nodes which are prioritized by associated int values.

Provides some convenience methods for code debugging and exception handling.

This class provides convenience and transformation services for Node- and EdgeMaps.

Implementation of a resettable high performance map for values of simple type boolean.

Implementation of a resettable high performance map for values of simple type double.

Implementation of a resettable high performance map for values of simple type int.

Implementation of a resettable high performance map for values of type Object.

This class is an abstract empty implementation of the NodeMap interface.

Implements a priority queue for nodes based on AVL Trees.

This class represents an ordered 2-Tuple that is consistent with equals() and hashCode().

This class can be used to wrap a given DataProvider with another one.

Generates pseudo-random numbers and the such.

Tag interface to mark comparator or comparable implementations that do not define a total order but only a partial order.

The copy factory interface used by GraphCopier to delegate the actual work to.

Defines an interface for specialized priority queues that contains nodes which are prioritized by associated double values.

Defines an interface for specialized priority queues that contains nodes which are prioritized by associated int values.

Specifies the contract of modifiable integer value objects.

Defines an interface for specialized priority queues that contains nodes which are prioritized by a comparable values.