Uses of Interface com.yworks.yfiles.algorithms.IDataProvider (yFiles-for-JavaFX-Complete-3.0 API)

Packages that use IDataProvider
Package	Description
com.yworks.yfiles.algorithms	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`).
com.yworks.yfiles.layout	Provides essential classes and interfaces that constitute the infrastructure for automatic graph layout generation.
com.yworks.yfiles.layout.hierarchic	Provides hierarchic layout style 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.router	Provides classes for automatic routing of the edges in a graph.
com.yworks.yfiles.layout.tree	Provides tree layout style algorithms.

Uses of IDataProvider in com.yworks.yfiles.algorithms

Subinterfaces of IDataProvider in com.yworks.yfiles.algorithms
Modifier and Type	Interface and Description
`interface`	`IDataMap` Interface that combines the `IDataProvider` and `IDataAcceptor` interfaces.
`interface`	`IEdgeMap` Provides access to data associated with an edge.
`interface`	`INodeMap` Provides access to data associated with a node.

Classes in com.yworks.yfiles.algorithms that implement IDataProvider
Modifier and Type	Class and Description
`class`	`DataProviderAdapter` An abstract adapter class for providing data.

Methods in com.yworks.yfiles.algorithms that return IDataProvider
Modifier and Type	Method and Description
`static IDataProvider`	DataProviders.`createConstantDataProvider(Object data)` Returns a DataProvider that returns the given value for each key.
`static IDataProvider`	DataProviders.`createEdgeDataProvider(boolean[] data)` Returns a DataProvider view of a boolean array defined for edges.
`static IDataProvider`	DataProviders.`createEdgeDataProvider(double[] data)` Returns a DataProvider view of a double array defined for edges.
`static IDataProvider`	DataProviders.`createEdgeDataProvider(double[] doubleData, int[] intData, boolean[] boolData, Object[] objectData)` Returns a DataProvider view of a double, int, boolean and Object array defined for edges.
`static IDataProvider`	DataProviders.`createEdgeDataProvider(int[] data)` Returns a DataProvider view of an int array defined for edges.
`static IDataProvider`	DataProviders.`createEdgeDataProvider(Object[] data)` Returns a DataProvider view of an Object array defined for edges.
`static IDataProvider`	DataProviders.`createNegatedDataProvider(IDataProvider data)` Returns a DataProvider that returns the negated boolean values provided by another data provider.
`static IDataProvider`	DataProviders.`createNodeDataProvider(boolean[] data)` Returns a DataProvider view of a boolean array defined for nodes.
`static IDataProvider`	DataProviders.`createNodeDataProvider(double[] data)` Returns a DataProvider view of a double array defined for nodes.
`static IDataProvider`	DataProviders.`createNodeDataProvider(double[] doubleData, int[] intData, boolean[] boolData, Object[] objectData)` Returns a DataProvider view of a double, int, boolean and Object array defined for nodes.
`static IDataProvider`	DataProviders.`createNodeDataProvider(int[] data)` Returns a DataProvider view of an int array defined for nodes.
`static IDataProvider`	DataProviders.`createNodeDataProvider(Object[] data)` Returns a DataProvider view of an Object array defined for nodes.
`static IDataProvider`	DataProviders.`createSourceDataProvider(IDataProvider nodeData)` Returns a DataProvider for edges that return the data provider values bound to their source nodes.
`static IDataProvider`	DataProviders.`createTargetDataProvider(IDataProvider nodeData)` Returns a DataProvider for edges that return the data provider values bound to their target nodes.
`IDataProvider`	Graph.`getDataProvider(Object providerKey)` Returns the data provider that is registered with the graph using the given look-up key.

Methods in com.yworks.yfiles.algorithms with parameters of type IDataProvider
Modifier and Type	Method and Description
`static boolean`	ShortestPaths.`acyclic(Graph graph, Node s, IDataProvider cost, INodeMap dist, INodeMap pred)` Each edge is associated with an arbitrary double value that represents the cost of that edge.
`void`	Graph.`addDataProvider(Object providerKey, IDataProvider data)` Registers the given data provider using the given look-up key.
`void`	DataProviders.DataProviderOverlayManager.`addDataProvider(Object dataProviderKey, IDataProvider newDataProvider)` Adds the given DataProvider under the given key to the graph.
`static boolean`	ShortestPaths.`bellmanFord(Graph graph, Node s, boolean directed, IDataProvider cost, INodeMap dist, INodeMap pred)` Solves the single-source shortest path problem for arbitrary graphs.
`static Edge`	Triangulator.`calcDelauneyTriangulation(Graph result, IDataProvider pointData, IEdgeMap revMap)` Computes a Delauney triangulation of the given points.
`static int`	NetworkFlows.`calcMaxFlow(Graph graph, Node source, Node sink, IDataProvider eCapDP, IEdgeMap flowEM)` Solves a maximum flow problem using the preflow-push method.
`static int`	NetworkFlows.`calcMaxFlowMinCut(Graph graph, Node source, Node sink, IDataProvider eCapDP, IEdgeMap flowEM, INodeMap sourceCutNM)` Solves a maximum flow problem using the preflow-push method but additionally marks all nodes that belong to the minimum cut set that is associated with the source of the network.
`static void`	Centrality.`closenessCentrality(Graph graph, INodeMap closeness, boolean directed, IDataProvider edgeCosts)` Computes the closeness centrality for the nodes of a graph.
`static EdgeList`	ShortestPaths.`constructEdgePath(Node s, Node t, IDataProvider pred)` Like `ShortestPaths.constructEdgePath(Node, Node, Edge[])` but the path edges are given by a `IDataProvider`.
`static NodeList`	ShortestPaths.`constructNodePath(Node s, Node t, IDataProvider pred)` Like `ShortestPaths.constructNodePath(Node, Node, Edge[])` but the path edges are given by a `IDataProvider`.
`static double`	SpanningTrees.`cost(EdgeList treeEdges, IDataProvider edgeCost)` Returns the overall cost of a previously calculated minimum spanning tree.
`static Comparator<Object>`	Comparators.`createComparableDataComparator(IDataProvider dp)` Returns a `Comparator` that compares objects of arbitrary type.
`static Comparator<Object>`	Comparators.`createDoubleDataComparator(IDataProvider dp)` Returns a `Comparator` that compares objects of arbitrary type.
`static Comparator<Object>`	Comparators.`createDoubleDataSourceComparator(IDataProvider dp)` Returns a `Comparator` that compares objects of type `Edge`.
`static Comparator<Object>`	Comparators.`createDoubleDataTargetComparator(IDataProvider dp)` Returns a `Comparator` that compares objects of type `Edge`.
`static Comparator<Object>`	Comparators.`createIntDataComparator(IDataProvider dp)` Returns a `Comparator` that compares objects of arbitrary type.
`static Comparator<Object>`	Comparators.`createIntDataSourceComparator(IDataProvider dp)` Returns a `Comparator` that compares objects of type `Edge`.
`static Comparator<Object>`	Comparators.`createIntDataTargetComparator(IDataProvider dp)` Returns a `Comparator` that compares objects of type `Edge`.
`static IDataProvider`	DataProviders.`createNegatedDataProvider(IDataProvider data)` Returns a DataProvider that returns the negated boolean values provided by another data provider.
`static IDataProvider`	DataProviders.`createSourceDataProvider(IDataProvider nodeData)` Returns a DataProvider for edges that return the data provider values bound to their source nodes.
`static IDataProvider`	DataProviders.`createTargetDataProvider(IDataProvider nodeData)` Returns a DataProvider for edges that return the data provider values bound to their target nodes.
`static void`	ShortestPaths.`dijkstra(Graph graph, Node s, boolean directed, IDataProvider cost, INodeMap dist, INodeMap pred)` Solves the single-source shortest path problem for arbitrary graphs.
`static void`	Centrality.`edgeBetweenness(Graph graph, IEdgeMap centrality, boolean directed, IDataProvider edgeCosts)` Computes betweenness centrality for each edge of a given graph.
`static int`	Groups.`edgeBetweennessClustering(Graph graph, INodeMap clusterIDs, boolean directed, int minGroupCount, int maxGroupCount, IDataProvider edgeCosts)` Partitions the graph into groups using edge betweenness centrality.
`static void`	Cycles.`findCycleEdges(Graph graph, IEdgeMap cycleEdges, IDataProvider costDP)` Marks the edges of a given graph whose removal or reversal would make the graph acyclic while trying to minimize the cost associated with the marked edges.
`static EdgeList`	Paths.`findLongestPath(Graph graph, IDataProvider edgeLength)` Returns the longest directed path in a given acyclic weighted graph.
`static void`	ShortestPaths.`findShortestUniformPaths(Graph graph, Node start, IDataProvider targetMap, boolean directed, int maxLength, EdgeList pathEdges, NodeList pathNodes)` Finds all nodes and edges that belong to a shortest path from a `start` node to a set of target nodes in the graph not farther away than a given distance.
`static NodeList[]`	Bfs.`getLayers(Graph graph, IDataProvider isCoreNode)` Returns the layers of nodes constructed by a breadth first search.
`static NodeList[]`	Bfs.`getLayers(Graph graph, IDataProvider isCoreNode, INodeMap layerIDMap)` Returns the layers of nodes constructed by a breadth first search.
`static void`	Centrality.`graphCentrality(Graph graph, INodeMap centrality, boolean directed, IDataProvider edgeCosts)` Computes the graph centrality for the nodes of a graph.
`void`	GraphPartitionManager.`initPartitions(IDataProvider partitionId)` Initializes internal data structures using the new DataProvider.
`static int`	Groups.`kMeansClustering(Graph graph, INodeMap clusterIDs, IDataProvider nodePositions, DistanceMetric distanceMetric, int k)` Partitions the graph into clusters using k-means clustering algorithm.
`static int`	Groups.`kMeansClustering(Graph graph, INodeMap clusterIDs, IDataProvider nodePositions, DistanceMetric distanceMetric, int k, int iterations)` Partitions the graph into clusters using k-means clustering algorithm.
`static int`	Groups.`kMeansClustering(Graph graph, INodeMap clusterIDs, IDataProvider nodePositions, DistanceMetric distanceMetric, int k, int iterations, YPoint[] centroids)` Partitions the graph into clusters using k-means clustering algorithm.
`static EdgeList`	SpanningTrees.`kruskal(Graph graph, IDataProvider cost)` Calculates a minimum spanning tree for the given graph.
`static YList`	ShortestPaths.`kShortestPaths(Graph graph, IDataProvider costDP, Node start, Node end, int k)` This method finds the `k` shortest paths connecting a pair of nodes in a directed graph with non-negative edge costs.
`static ICursor`	ShortestPaths.`kShortestPathsCursor(Graph graph, IDataProvider costDP, Node start, Node end, int k)` A variant of `ShortestPaths.kShortestPaths(Graph, IDataProvider, Node, Node, int)` that returns the result as a special cursor that calculates the next path in the sequence only when needed.
`static int`	NetworkFlows.`minCostFlow(Graph graph, IDataProvider lCapDP, IDataProvider uCapDP, IDataProvider cost0DP, IDataProvider supplyDP, IEdgeMap flowEM, INodeMap dualsNM)` Solves a minimum cost flow problem with a capacity scaling algorithm.
`static int`	NetworkFlows.`minCostFlow(Graph graph, IDataProvider uCapDP, IDataProvider cost0DP, IDataProvider supplyDP, IEdgeMap flowEM, INodeMap dualsNM)` Uses method `NetworkFlows.minCostFlow(Graph, IDataProvider, IDataProvider, IDataProvider, IDataProvider, IEdgeMap, INodeMap)` to solve a minimum cost flow problem.
`static int`	NetworkFlows.`minCostFlow(Graph graph, Node s, Node t, IDataProvider uCapDP, IDataProvider cost0DP, IEdgeMap flowEM, INodeMap dualsNM)` Solves a minimum cost maximum flow problem.
`static EdgeList`	SpanningTrees.`minimum(Graph graph, IDataProvider cost)` Calculates a minimum spanning tree for the given graph.
`static void`	Centrality.`nodeBetweenness(Graph graph, INodeMap centrality, boolean directed, IDataProvider edgeCosts)` Computes betweenness centrality for each node of a given graph.
`static void`	Centrality.`nodeEdgeBetweenness(Graph graph, INodeMap nodeCentrality, IEdgeMap edgeCentrality, boolean directed, IDataProvider edgeCosts)` Computes betweenness centrality for each node and edge of a given graph.
`static EdgeList`	SpanningTrees.`prim(Graph graph, IDataProvider cost)` Calculates a minimum spanning tree for the given graph.
`static EdgeList[]`	ShortestPaths.`shortestPair(Graph graph, Node source, Node target, boolean directed, IDataProvider costDP)` Returns two edge-disjoint paths in a non-negatively weighted directed graph, such that both paths connect nodes `s` and `t` and have minimum total length.
`static int`	RankAssignments.`simplex(Graph graph, INodeMap layer, IDataProvider w, IDataProvider minLength)` Solves the rank assignment problem using the simplex method given a maximum time duration for the algorithm.
`static int`	RankAssignments.`simplex(Graph graph, INodeMap layer, IDataProvider w, IDataProvider minLength, IEdgeMap tree, Node _root, boolean validRanking)` Similar to `RankAssignments.simplex(Graph, INodeMap, IDataProvider, IDataProvider, long)` but, additionally, it is possible to provide a valid initial tree solution for the problem.
`static int`	RankAssignments.`simplex(Graph graph, INodeMap layer, IDataProvider w, IDataProvider minLength, IEdgeMap tree, Node _root, boolean validRanking, long maximalDuration)` Similar to `RankAssignments.simplex(Graph, INodeMap, IDataProvider, IDataProvider, long)` but, additionally, it is possible to provide a valid initial tree solution for the problem.
`static int`	RankAssignments.`simplex(Graph graph, INodeMap layer, IDataProvider w, IDataProvider minLength, long maximalDuration)` Solves the rank assignment problem using the simplex method given a maximum time duration for the algorithm.
`static boolean`	ShortestPaths.`singleSource(Graph graph, Node s, boolean directed, IDataProvider cost, INodeMap dist, INodeMap pred)` This method solves the single-source shortest path problem for arbitrary graphs.
`static EdgeList`	ShortestPaths.`singleSourceSingleSink(Graph graph, Node s, Node t, boolean directed, IDataProvider cost)` Similar to `ShortestPaths.singleSourceSingleSink(Graph, Node, Node, boolean, IDataProvider, INodeMap)` but instead of returning the shortest distance between the source and sink the actual shortest edge path between these nodes will be returned.
`static double`	ShortestPaths.`singleSourceSingleSink(Graph graph, Node s, Node t, boolean directed, IDataProvider cost, INodeMap pred)` Like `ShortestPaths.singleSourceSingleSink(Graph, Node, Node, boolean, double[], Edge[])` but uses `INodeMap`s and `IDataProvider`s instead of arrays.
`static Node[]`	Sorting.`sortNodesByIntKey(Graph graph, IDataProvider keys)` Sorts the nodes of a given graph by an integer key associated with each node through a `IDataProvider`.
`static Edge`	Triangulator.`triangulatePoints(Graph result, IDataProvider pointData, IEdgeMap reverseEdgeMap)` Computes a triangulation of the given points.
`static void`	Centrality.`weightCentrality(Graph graph, INodeMap centrality, boolean considerInEdges, boolean considerOutEdges, IDataProvider edgeWeights)` Computes the weight centrality for the nodes of a graph.

Constructors in com.yworks.yfiles.algorithms with parameters of type IDataProvider
Constructor and Description
`EdgeList(IEdgeCursor ec, IDataProvider predicate)` Creates a list that is initialized with those edges from the given EdgeCursor object for which the given data provider returns `true` upon calling its `getBool` method.
`GraphPartitionManager(Graph graph, IDataProvider partitionId)` Instantiates a new GraphPartitionManager for the given graph.
`NodeList(INodeCursor nc, IDataProvider predicate)` Creates a list that is initialized with those nodes from the given NodeCursor object for which the given data provider returns `true` upon calling its `getBool` method.
`YList(ICursor c, IDataProvider predicate)` Creates a list that is initialized with those elements from the given YCursor object for which the given data provider returns `true` upon calling its `getBool` method.

Uses of IDataProvider in com.yworks.yfiles.layout

Classes in com.yworks.yfiles.layout that implement IDataProvider
Modifier and Type	Class and Description
`class`	`DataMapAdapter<K,V>` An adapter implementation that wraps an `IMapper` to an `IDataMap`.

Methods in com.yworks.yfiles.layout that return IDataProvider
Modifier and Type	Method and Description
`<K,V> IDataProvider`	LayoutGraphAdapter.`addDataProvider(Object dataKey, IMapper<K,V> mapper)` Registers a data provider with the graph using the given look-up key and wrapping the given mapper.
`<K,V> IDataProvider`	YGraphAdapter.`createDataProvider(Class<K> kType, Function<K,V> getter)` Creates an `IDataProvider` that delegates to the provided delegate when queried for items in the `YGraph`.
`<K,V> IDataProvider`	YGraphAdapter.`createDataProvider(Class<K> kType, IMapper<K,V> mapper)` Creates an `IDataProvider` that delegates to the provided `IMapper` when queried for items in the `YGraph`.
`IDataProvider`	LayoutGraphAdapter.`getDataProvider(Object dataKey)`

Methods in com.yworks.yfiles.layout with parameters of type IDataProvider
Modifier and Type	Method and Description
`static void`	Swimlanes.`arrangeSwimlanes(Graph graph, IDataProvider node2Swimlane)` Calculates an ordering of the swimlanes.
`static void`	Swimlanes.`arrangeSwimlanes(Graph graph, IDataProvider node2Swimlane, int iterations, SwimlanesMode mode)` Calculates an ordering of the swimlanes considering the specified ordering mode.
`<T> IMapper<IModelItem,T>`	YGraphAdapter.`createMapper(IDataProvider dataProvider)` Creates an `IMapper` that delegates to the provided `IDataProvider` when queried for items in the `IGraph`.
`static EdgeFlow`	LayoutGraphUtilities.`determineEdgeFlowDirection(LayoutGraph graph, IDataProvider considerEdges)` Determines the main direction of the edge flow by analyzing the current layout of the graph.
`static boolean`	LayoutGraphUtilities.`isUsingOctilinearEdgeRoutes(LayoutGraph graph, IDataProvider considerEdges)` Determines whether or not most of the edges of the graph are routed octilinear.
`static boolean`	LayoutGraphUtilities.`isUsingOrthogonalEdgeRoutes(LayoutGraph graph, IDataProvider considerEdges)` Determines whether or not most of the edges of the graph are routed orthogonally.
`void`	PartitionLayout.IPartitionPlacer.`placePartitions(LayoutGraph graph, IDataProvider partitionIDDP, IDataProvider interEdgeDP)` Arranges the graph while taking partition IDs and inter-edge information into account.
`void`	PartitionLayout.IInterEdgeRouter.`routeInterEdges(LayoutGraph graph, IDataProvider partitionIDDP, IDataProvider interEdgeDP)` Routes inter-edges of the partitioned graph.

Uses of IDataProvider in com.yworks.yfiles.layout.hierarchic

Fields in com.yworks.yfiles.layout.hierarchic declared as IDataProvider
Modifier and Type	Field and Description
`protected IDataProvider`	WeightedLayerer.`weight` This is a `IDataProvider` that holds for each `Edge` an integer value representing its weight.

Methods in com.yworks.yfiles.layout.hierarchic that return IDataProvider
Modifier and Type	Method and Description
`protected IDataProvider`	HierarchicLayoutCore.`getEdgeLayoutDescriptors(LayoutGraph graph)` Callback method called during `HierarchicLayoutCore.applyLayoutCore(LayoutGraph)` and returns a `IDataProvider` that holds the `EdgeLayoutDescriptor` information.
`protected IDataProvider`	HierarchicLayoutCore.`getIncrementalHints(LayoutGraph graph)` Callback method called during `HierarchicLayoutCore.applyLayoutCore(LayoutGraph)` and returns a `IDataProvider` that holds the `com.yworks.yfiles.layout.hierarchic.HierarchicLayoutCore.IncrementalHint`s information.
`protected IDataProvider`	HierarchicLayoutCore.`getNodeLayoutDescriptors(LayoutGraph graph)` Callback method called during `HierarchicLayoutCore.applyLayoutCore(LayoutGraph)` and returns a `IDataProvider` that holds the `NodeLayoutDescriptor` information.
`protected IDataProvider`	PortCandidateOptimizer.`getPortCandidateSetDataProvider(LayoutGraph graph)` Returns the data provider that provides the port candidate sets for nodes.
`protected IDataProvider`	HierarchicLayoutCore.`getSwimLaneDescriptors(LayoutGraph graph)` Callback method called during `HierarchicLayoutCore.applyLayoutCore(LayoutGraph)` and returns a `IDataProvider` that holds the `SwimlaneDescriptor` information.

Methods in com.yworks.yfiles.layout.hierarchic with parameters of type IDataProvider
Modifier and Type	Method and Description
`int`	WeightedLayerer.`assignNodeLayer(LayoutGraph graph, INodeMap layerID, EdgeList reversedEdges, IDataProvider weight)` Assigns all nodes of the graph to layers.
`void`	SelfLoopCalculator.`calculateSelfLoops(LayoutGraph graph, Node node, IDataProvider spc, IDataProvider tpc)` Calculates all self-loops at the given node of the given input graph.
`void`	SelfLoopCalculator.`calculateSelfLoops(LayoutGraph graph, Node node, YList selfLoops, IDataProvider spc, IDataProvider tpc)` Convenience method that calculates a list of self-loops that belong to a given node.
`int`	GivenLayersLayerer.`normalize(Graph graph, IDataProvider layerId, IDataAcceptor normalizedLayerId)` Convenience method that removes empty layers and ensures that the smallest layer has value `0`.
`protected void`	MultiComponentLayerer.`sort(NodeList[] nodeLists, IDataProvider componentIndexProvider)` Sorts an array which consists of `NodeList`s each of which contains nodes that belong to the same component.

Uses of IDataProvider in com.yworks.yfiles.layout.multipage

Methods in com.yworks.yfiles.layout.multipage with parameters of type IDataProvider
Modifier and Type	Method and Description
`protected void`	MultiPageLayout.`applyIncrementalLayout(LayoutGraph graph, IDataProvider incrementalNodesDP, LayoutContext context)` This method is called to further improve the layout results.
`protected void`	MultiPageLayout.`routeRestoredEdges(LayoutGraph graph, IDataProvider selectedEdgesDP, YRectangle boundingRectangle)` This method is called by `MultiPageLayout.removeConnectorPair(Node, Node, YList, LayoutContext)` to route the restored edges.

Uses of IDataProvider in com.yworks.yfiles.layout.router

Methods in com.yworks.yfiles.layout.router with parameters of type IDataProvider
Modifier and Type	Method and Description
`static EdgeList`	BusRepresentations.`replaceHubsBySubgraph(LayoutGraph graph, EdgeList[] hubEdgesLists, IDataProvider hubMarker, IDataProvider fixedMarker, IDataAcceptor descriptorAcceptor)` Changes the representation of buses from hubs to complete subgraphs by creating new edges between regular nodes and removing the hubs.
`static EdgeList`	BusRepresentations.`replaceHubsBySubgraph(LayoutGraph graph, IDataProvider hubMarker, IDataAcceptor descriptorAcceptor)` Changes the representation of buses from hubs to complete subgraphs.
`static void`	BusRepresentations.`replaceSubgraphByHubs(LayoutGraph graph, IEdgeCursor edgeCursor, IDataProvider descriptorProvider, IDataAcceptor busIDAcceptor)` Changes the representation of buses from complete subgraphs to hubs by replacing intersection points by hubs.
`static EdgeList[]`	BusRepresentations.`toEdgeLists(Graph graph, IDataProvider hubMarker)` Calculates for every bus represented by hubs a list of all of its edges.

Uses of IDataProvider in com.yworks.yfiles.layout.tree

Fields in com.yworks.yfiles.layout.tree declared as IDataProvider
Modifier and Type	Field and Description
`protected IDataProvider`	AbstractRotatableNodePlacer.`nodeShapeProvider` The provider of `TreeLayout.SubtreeShape`s for single nodes.
`protected IDataProvider`	AbstractRotatableNodePlacer.`subtreeShapeProvider` The provider of `TreeLayout.SubtreeShape`s for whole subtrees.

Methods in com.yworks.yfiles.layout.tree that return IDataProvider
Modifier and Type	Method and Description
`static IDataProvider`	LeftRightNodePlacer.`createLeftRightDataProvider(IDataProvider nodePlacerMap)` Creates a special `IDataProvider` that determines whether a given node is placed left or right of the parent node.

Methods in com.yworks.yfiles.layout.tree with parameters of type IDataProvider
Modifier and Type	Method and Description
`protected void`	TreeComponentLayout.`applyLayoutUsingDummies(LayoutGraph graph, IDataProvider dummyDp)` Delegates the layout calculation to the `core layout algorithm` and handles the dummy nodes.
`static IDataProvider`	LeftRightNodePlacer.`createLeftRightDataProvider(IDataProvider nodePlacerMap)` Creates a special `IDataProvider` that determines whether a given node is placed left or right of the parent node.
`TreeLayout.SubtreeShape`	LeafNodePlacer.`placeSubtree(IDataProvider nodeShapeProvider, IDataProvider subtreeShapeProvider, LayoutGraph graph, Node localRoot, ParentConnectorDirection parentConnectorDirection)` Creates a `TreeLayout.SubtreeShape` for the local root node (a leaf node in this case) and adds target points to the incoming edge.
`TreeLayout.SubtreeShape`	INodePlacer.`placeSubtree(IDataProvider nodeShapeProvider, IDataProvider subtreeShapeProvider, LayoutGraph graph, Node localRoot, ParentConnectorDirection parentConnectorDirection)` Arranges the `SubtreeShapes` of the local root and its children and routes the edges that connect them.
`TreeLayout.SubtreeShape`	GroupedNodePlacer.`placeSubtree(IDataProvider nodeShapeProvider, IDataProvider subtreeShapeProvider, LayoutGraph graph, Node localRoot, ParentConnectorDirection parentConnectorDirection)` Places the groups of `TreeLayout.SubtreeShape`s according to their group IDs.
`TreeLayout.SubtreeShape`	DendrogramNodePlacer.`placeSubtree(IDataProvider nodeShapeProvider, IDataProvider subtreeShapeProvider, LayoutGraph graph, Node localRoot, ParentConnectorDirection parentConnectorDirection)` Arranges the `SubtreeShapes` of the local root and its children as a dendrogram.
`TreeLayout.SubtreeShape`	DelegatingNodePlacer.`placeSubtree(IDataProvider nodeShapeProvider, IDataProvider subtreeShapeProvider, LayoutGraph graph, Node localRoot, ParentConnectorDirection parentConnectorDirection)` Places the `TreeLayout.SubtreeShape`s of the child nodes using the two delegate node placers retrieved with `PrimaryPlacer` and `SecondaryPlacer`.
`TreeLayout.SubtreeShape`	AssistantNodePlacer.`placeSubtree(IDataProvider nodeShapeProvider, IDataProvider subtreeShapeProvider, LayoutGraph graph, Node localRoot, ParentConnectorDirection parentConnectorDirection)` Delegates the arrangement of `TreeLayout.SubtreeShape`s to an instance of `LeftRightNodePlacer`.
`TreeLayout.SubtreeShape`	AbstractRotatableNodePlacer.`placeSubtree(IDataProvider nodeShapeProvider, IDataProvider subtreeShapeProvider, LayoutGraph graph, Node localRoot, ParentConnectorDirection parentConnectorDirection)` Initializes the local data structures and then delegates the work to the abstract variant of this method (`AbstractRotatableNodePlacer.placeSubtree(Node, ParentConnectorDirection)`).
`TreeLayout.SubtreeShape`	AbstractNodePlacer.`placeSubtree(IDataProvider nodeShapeProvider, IDataProvider subtreeShapeProvider, LayoutGraph graph, Node localRoot, ParentConnectorDirection parentConnectorDirection)` Initializes the local data structures and then delegates the work to the abstract variant of this method (`AbstractNodePlacer.placeSubtree(Node, ParentConnectorDirection)`).

Uses of Interfacecom.yworks.yfiles.algorithms.IDataProvider

Uses of IDataProvider in com.yworks.yfiles.algorithms

Uses of IDataProvider in com.yworks.yfiles.layout

Uses of IDataProvider in com.yworks.yfiles.layout.hierarchic

Uses of IDataProvider in com.yworks.yfiles.layout.multipage

Uses of IDataProvider in com.yworks.yfiles.layout.router

Uses of IDataProvider in com.yworks.yfiles.layout.tree

Uses of Interface
com.yworks.yfiles.algorithms.IDataProvider