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 ).

Classes

  ClassDescription
Public classAlgorithmAbortedException
Exception that gets thrown by an algorithm when the thread executing the algorithm was interrupted.
Public classBfs
This class provides services that center around breadth first search (BFS)
Public classBipartitions
Responsible for graph bipartition problems.
Public classCentrality
This class provides methods to determine various centrality indices of nodes or edges of a graph.
Public classCycles
Responsible for finding cycles within a graph that have certain properties.
Public classDfs
Framework class for depth first search (DFS) based algorithms.
Public classEdge
Represents an edge, i.e., a directed connection between two nodes (represented by instances of class Node ) in the directed graph data type Graph .
Public classEdgeList
Specialized list implementation for instances of type Edge .
Public classGraph
This class implements a directed graph structure.
Public classGraphChecker
Provides methods that check structural properties of a given graph.
Public classGraphConnectivity
Provides algorithms for determining certain connectivity components within a graph.
Public classGraphCopyFactory
Very simple default implementation of a Copy Factory that creates Graph instances and simply delegates to the CreateNode()()()() and CreateEdge(Node, Node) method.
Public classGraphEvent
An event which indicates that a graph structure change occurred.
Public classGraphObject
Common base type for both Node and Edge.
Public classGroups
This class provides methods for automatically partitioning nodes of a graph into groups.
Public classIndependentSets
This class provides methods for calculating independent sets.
Public classInvalidGraphStructureException
Exception thrown when a graph-structural precondition is violated.
Public classListCell
Represents a so-called "cell" or "link" of the doubly linked list implementation YList .
Public classNetworkFlows
Provides sophisticated algorithms for solving classical network flow problems like MinCostFlow or MaxFlow.
Public classNode
Represents a so-called node in the directed graph data type Graph .
Public classNodeList
Specialized list implementation for instances of type Node .
Public classNodeOrders
Provides graph algorithms that order the nodes of a graph by a specific criterion.
Public classPaths
Responsible for finding paths within a graph that have certain properties.
Public classRankAssignments
Provides algorithms for solving the rank assignment problem.
Public classShortestPaths
Provides diverse algorithms and helper methods for solving the shortest path problem on weighted graphs.
Public classSorting
This class provides methods for efficiently sorting graph elements in graph structures.
Public classSpanningTrees
Provides (minimum) spanning tree algorithms for graphs.
Public classTransitivity
Provides algorithms to compute reachability information for directed, acyclic graphs.
Public classTrees
Provides diverse algorithms and services for tree-structured graphs or subgraphs.
Public classYList
An implementation of a doubly linked list that provides direct access to the cells that store the elements.
Public classYList..::..ListCursorImpl
Cursor implementation for class YList.

Interfaces

  InterfaceDescription
Public interfaceICursor
A general interface for iterating over a collection of objects.
Public interfaceIDataAcceptor
A general interface for setting data.
Public interfaceIDataMap
Interface that combines the IDataProvider and IDataAcceptor interfaces.
Public interfaceIDataProvider
A general interface for data provision.
Public interfaceIEdgeCursor
A cursor interface for iterating over edges.
Public interfaceIEdgeMap
Provides access to data associated with an edge.
Public interfaceIGraphInterface
An interface that describes the structural information of a graph and the data that is associated with its nodes and edges.
Public interfaceIGraphListener
The listener interface for receiving graph events.
Public interfaceINodeCursor
A cursor interface for iterating over nodes.
Public interfaceINodeMap
Provides access to data associated with a node.
Public interfaceINodeSequencer
Generic Interface for classes that provide an ordering for the nodes of a graph.

Enumerations

  EnumerationDescription
Public enumerationBfsDirection
Public enumerationGraphElementInsertion
Object insertion specifier.
Public enumerationGraphEventType

Remarks

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 .

Related Documentation

See the yFiles Developer's Guide chapter Working With the Graph Structure for detailed discussions of using the graph data type and its functionality.
The section on Binding Data to Graph Elements explains the concept of data accessors.