Uses of Class
com.yworks.yfiles.algorithms.NodeList

Packages that use NodeList

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.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.tree	Provides tree layout style algorithms.

Uses of NodeList in com.yworks.yfiles.algorithms

Fields in com.yworks.yfiles.algorithms declared as NodeList

Modifier and Type	Field and Description
protected NodeList	LayoutGraphHider.hiddenNodes holds the list of the hidden nodes in stack order.

Methods in com.yworks.yfiles.algorithms that return NodeList

Modifier and Type	Method and Description
static NodeList[]	GraphConnectivity.connectedComponents(Graph graph) Calculates the connected components of a given graph.
static NodeList	Paths.constructNodePath(EdgeList path) Constructs a path of nodes from a given path of edges.
static NodeList	ShortestPaths.constructNodePath(Node s, Node t, Edge[] pred) Convenience method that constructs an explicit path of nodes from the result returned by one of the shortest paths methods defined in this class.
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 NodeList	NodeOrders.dfsCompletion(Graph graph) Calculates an ordering of the nodes identical to the order of node completion events in a depth first search.
NodeList	Groups.Dendrogram.getChildren(Node parent) Returns a NodeList that contains the child nodes of the given parent node.
NodeList[]	Groups.Dendrogram.getClusterNodes(Node node) Returns an array of NodeLists that contain the nodes of the original graph that are associated with the given dendrogram node.
static NodeList	IndependentSets.getIndependentSet(Graph conflictGraph) Calculates an independent set for a given graph.
static NodeList[]	IndependentSets.getIndependentSets(Graph conflictGraph) Partitions the set of nodes of the given graph into independent sets.
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 NodeList[]	Bfs.getLayers(Graph graph, NodeList coreNodes) Returns the layers of nodes calculated by a breadth first search.
static NodeList[]	Bfs.getLayers(Graph graph, NodeList coreNodes, BfsDirection direction, INodeMap layerIDMap) Returns the layers of nodes constructed by a directed/undirected breadth first search where the maximum number of layers is restricted.
static NodeList[]	Bfs.getLayers(Graph graph, NodeList coreNodes, BfsDirection direction, INodeMap layerIDMap, int maxLayers) Returns the layers of nodes constructed by a directed/undirected breadth first search where the maximum number of layers is restricted.
static NodeList[]	Bfs.getLayers(Graph graph, NodeList coreNodes, boolean directed, INodeMap layerIDMap) Returns the layers of nodes constructed by a directed/undirected breadth first search where the maximum number of layers is restricted.
static NodeList[]	Bfs.getLayers(Graph graph, NodeList coreNodes, boolean directed, INodeMap layerIDMap, int maxLayers) Returns the layers of nodes constructed by a directed/undirected breadth first search where the maximum number of layers is restricted.
static NodeList[]	Bfs.getLayers(Graph graph, NodeList coreNodes, INodeMap layerIDMap) Returns the layers of nodes constructed by a breadth first search.
static NodeList	Trees.getLeafNodes(Graph tree, boolean directedRootedTree) Returns all leaf nodes of the given tree.
static NodeList	GraphConnectivity.getNeighbors(Graph graph, NodeList startNodes, int maxDistance) Determines the direct or indirect neighbors of a given set of nodes.
static NodeList	GraphConnectivity.getPredecessors(Graph graph, NodeList startNodes, int maxDistance) Determines the direct or indirect predecessors of a given list of nodes.
static NodeList	GraphConnectivity.getSuccessors(Graph graph, NodeList startNodes, int maxDistance) Determines the direct or indirect successors of a given list of nodes.
static NodeList[]	Trees.getTreeNodes(Graph graph) Returns an array of NodeList objects each containing nodes that belong to a maximal directed subtree of the given graph.
static NodeList[]	Trees.getUndirectedTreeNodes(Graph graph) Returns an array of NodeList objects each containing nodes that belong to a maximal undirected subtree of the given graph.
static NodeList	NodeOrders.st(Graph graph) Assigns an st-ordering to the nodes of a biconnected graph.
static NodeList[]	GraphConnectivity.stronglyConnectedComponents(Graph graph) Calculates the strongly connected components of a given graph.
static NodeList	NodeOrders.toNodeList(Graph graph, int[] order) Converts an array-based result returned by a method of this class to a NodeList that contains all nodes in the order provided by the given array.
static NodeList[]	GraphConnectivity.toNodeListArray(Graph graph, INodeMap compNum, int maxCompNum) Transforms the return values of method GraphConnectivity.connectedComponents(Graph, INodeMap) to an array of NodeLists, like it is returned by GraphConnectivity.connectedComponents(Graph).
static NodeList	NodeOrders.topological(Graph graph) Returns a topological ordering of the nodes of a directed acyclic graph.

Methods in com.yworks.yfiles.algorithms with parameters of type NodeList

Modifier and Type	Method and Description
static void	Trees.collectSubtree(Node root, NodeList nodes) Collects all nodes of the subtree starting from the given root node.
static boolean	Paths.findPath(Graph graph, NodeList topSort, Node startNode, Node endNode, IEdgeMap predicate) Returns whether or not a directed path from a start node to another node in an acyclic graph exists.
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, NodeList coreNodes) Returns the layers of nodes calculated by a breadth first search.
static NodeList[]	Bfs.getLayers(Graph graph, NodeList coreNodes, BfsDirection direction, INodeMap layerIDMap) Returns the layers of nodes constructed by a directed/undirected breadth first search where the maximum number of layers is restricted.
static NodeList[]	Bfs.getLayers(Graph graph, NodeList coreNodes, BfsDirection direction, INodeMap layerIDMap, int maxLayers) Returns the layers of nodes constructed by a directed/undirected breadth first search where the maximum number of layers is restricted.
static NodeList[]	Bfs.getLayers(Graph graph, NodeList coreNodes, boolean directed, INodeMap layerIDMap) Returns the layers of nodes constructed by a directed/undirected breadth first search where the maximum number of layers is restricted.
static NodeList[]	Bfs.getLayers(Graph graph, NodeList coreNodes, boolean directed, INodeMap layerIDMap, int maxLayers) Returns the layers of nodes constructed by a directed/undirected breadth first search where the maximum number of layers is restricted.
static NodeList[]	Bfs.getLayers(Graph graph, NodeList coreNodes, INodeMap layerIDMap) Returns the layers of nodes constructed by a breadth first search.
static Node	Trees.getNearestCommonAncestor(Graph tree, Node root, boolean rootedDownward, NodeList nodes) Returns the nearest common ancestor of a subset of nodes within a directed rooted tree.
static NodeList	GraphConnectivity.getNeighbors(Graph graph, NodeList startNodes, int maxDistance) Determines the direct or indirect neighbors of a given set of nodes.
static NodeList	GraphConnectivity.getPredecessors(Graph graph, NodeList startNodes, int maxDistance) Determines the direct or indirect predecessors of a given list of nodes.
static NodeList	GraphConnectivity.getSuccessors(Graph graph, NodeList startNodes, int maxDistance) Determines the direct or indirect successors of a given list of nodes.
static EdgeList[]	Trees.getTreeEdges(Graph graph, NodeList[] treeNodes) Returns an array of EdgeList objects each containing edges that belong to a maximal directed subtree of the given graph.
void	LayoutGraphHider.hide(NodeList nl) Hides the given list of nodes from the graph.
void	GraphPartitionManager.hide(NodeList nl) Hides the given list of nodes from the graph.
static void	NodeOrders.toNodeMap(NodeList order, INodeMap result) Copies a NodeList-based result returned by a method of this class to a INodeMap that will provide values of basic type int.
void	LayoutGraphHider.unhideNodes(NodeList nodes, boolean unhideAdjacentEdges) Unhides the given nodes and if requested its adjacent edges.

Constructors in com.yworks.yfiles.algorithms with parameters of type NodeList

Constructor and Description
NodeList(NodeList list) Creates a list that is initialized with the entries of the given list.

Uses of NodeList in com.yworks.yfiles.layout

Methods in com.yworks.yfiles.layout that return NodeList

Modifier and Type	Method and Description
NodeList	YGraphAdapter.createNodeList(Iterable<INode> nodes) Creates a NodeList that maps the nodes from the Iterable to their copied ones.
NodeList	GroupingSupport.getChildren(Node parent) Returns the direct children of the given group node.
NodeList	GroupingSupport.getDescendants(Node parent) Returns all descendants of the given group node.

Methods in com.yworks.yfiles.layout with parameters of type NodeList

Modifier and Type	Method and Description
protected void	BendConverter.addedPathForEdge(LayoutGraph graph, Edge edge, NodeList dummyNodes) Adds information to newly created dummy nodes.
static void	LayoutGraphUtilities.alignNodeLayouts(LayoutGraph graph, NodeList nodes, Node referenceNode, boolean vertical, NodeAlignment mode) Aligns the specified nodes either vertically or horizontally according to the specified node alignment mode.
protected void	ComponentLayout.arrangeComponents(LayoutGraph graph, NodeList[] nodes, EdgeList[] edges, YRectangle[] bbox, Rectangle2D[] boxes) Produces a component graph layout.
protected void	ComponentLayout.arrangeFields(LayoutGraph graph, NodeList[] nodes, EdgeList[] edges, YRectangle[] bbox, Rectangle2D[] boxes, boolean circular, boolean fill, boolean fromSketch) Arranges the bounding boxes of the components.
protected Rectangle2D	FixNodeLayoutStage.calculateBounds(LayoutGraph graph, NodeList fixed) Calculates the bounding box of the specified nodes.
Rectangle2D	MinimumSizeGroupBoundsCalculator.calculateBounds(LayoutGraph graph, Node groupNode, NodeList children) Calculates the bounds of the given group node, enlarges the bounds by the insets associated with the group node and makes sure that the size of the group node obeys the associated minimum size.
Rectangle2D	InsetsGroupBoundsCalculator.calculateBounds(LayoutGraph graph, Node groupNode, NodeList children) Calculates the bounds of the given group node and enlarges the bounds by the insets associated with the group node.
Rectangle2D	IGroupBoundsCalculator.calculateBounds(LayoutGraph graph, Node groupNode, NodeList children) Calculates the bounds of the given group node that contains the given list of child nodes.
protected YPoint	FixNodeLayoutStage.calculateFixPoint(LayoutGraph graph, NodeList fixed) Calculates the fix point for the specified nodes in the specified graph.
protected Rectangle2D	InsetsGroupBoundsCalculator.createEnlargedBounds(LayoutGraph graph, Node groupNode, NodeList children, Rectangle2D bounds) Enlarges the given graph bounds by the insets associated with the given group node.
IListEnumerable<INode>	YGraphAdapter.createNodeEnumerable(NodeList nodes) Creates an enumerable of nodes that maps the nodes from the NodeList to their original ones.
protected void	ComponentLayout.setOrigin(LayoutGraph graph, NodeList nodes, EdgeList edges, YPoint origin, YRectangle rectangle) Moves the subgraph containing the given nodes and edges to the specified origin.

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

Methods in com.yworks.yfiles.layout.hierarchic that return NodeList

Modifier and Type	Method and Description
NodeList	GroupingSupport.getChildren(Node groupNode) Returns the direct children of the given group node.
NodeList	GroupingSupport.getDescendants(Node groupNode) Returns the descendant Nodes of the given group node.
NodeList	AbstractPortConstraintOptimizer.SameLayerData.getDummyNodes() Gets all dummy nodes of this AbstractPortConstraintOptimizer.SameLayerData instance.
NodeList	ILayer.getList() Gets a list of the Nodes associated with this ILayer instance.

Methods in com.yworks.yfiles.layout.hierarchic with parameters of type NodeList

Modifier and Type	Method and Description
protected void	SimplexNodePlacer.assignNodesToSublayer(NodeList layerNodes, ILayoutDataProvider ldp, LayoutGraph graph, INodeMap lowerSublayer) Assigns the nodes of a given layer to the corresponding upper/lower sublayer if node compaction is enabled.
protected void	MultiComponentLayerer.sort(NodeList[] nodeLists, IDataProvider componentIndexProvider) Sorts an array which consists of NodeLists each of which contains nodes that belong to the same component.

Uses of NodeList in com.yworks.yfiles.layout.partial

Methods in com.yworks.yfiles.layout.partial with parameters of type NodeList

Modifier and Type	Method and Description
protected void	PartialLayout.placeSubgraphs(LayoutGraph graph, NodeList[] subgraphComponents) This method is called during the layout process and places the subgraph components one-by-one onto the drawing area.

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

Methods in com.yworks.yfiles.layout.tree that return NodeList

Modifier and Type	Method and Description
protected NodeList	DelegatingNodePlacer.primaryChildren(Node localRoot, LayoutGraph graph) Returns all upper-left children of the local root node.
protected NodeList	DelegatingNodePlacer.secondaryChildren(Node localRoot, LayoutGraph graph) Returns all lower-right children of the local root node.