Uses of Class
de.grogra.imp2d.layout.Node

Packages that use Node

Package	Description
de.grogra.imp2d.layout

Uses of Node in de.grogra.imp2d.layout

Fields in de.grogra.imp2d.layout declared as Node

Modifier and Type	Field	Description
final Node	Node.next	The next node in the linked list of all nodes.
final Node	Edge.source	The source node of this edge.
final Node	Edge.target	The target node of this edge.

Methods in de.grogra.imp2d.layout that return Node

Modifier and Type	Method	Description
Node	Edge.getNeighbor(Node n)	Returns the neighbor of n.

Methods in de.grogra.imp2d.layout with parameters of type Node

Modifier and Type	Method	Description
protected Vector	ForceBasedLayout2.FBAlgorithm2.allocationNodes(Node nodeTemp, Vector vNodes)
protected void	ForceBasedLayout2.FBAlgorithm2.applyVectorToNode(Node nodeTemp, Point2d diff, double delta)
protected void	DavidsonHarelLayout.computeForce(Node s, Node t, Vector2f force)	Computes the repelling force of two nodes s and t
protected void	EadesLayout.computeForce(Node s, Node t, Vector2f force)	Comnputes the repelling force of two nodes s and t
protected abstract void	ForceBasedLayout.computeForce(Node s, Node t, Vector2f force)	Computes the force contribution of a pair of nodes.
protected void	FruchtermanReingoldLayout.computeForce(Node s, Node t, Vector2f force)	Calculating the repelling force of two nodes s and t
protected void	SpringLayout.computeForce(Node s, Node t, Vector2f force)
protected void	Layout.Algorithm.fitLayoutToWindow(Node nodes, int param)	rotates and scales a graph to fit in the drawing window possibility for choosing the param: 0 -> the first node will be arranged in the centre of the drawing window, then zooming else -> calculating the max distance in the graph, then zooming
LinkedList	GraphUtilities.getConnectedNodes(Node nodes)	Dividing the nodes of the graph into connectedNodes (= nodes that have edges to other nodes) and unconnectedNodes (= nodes that don't have edges to other nodes of the graph)
protected int	GraphUtilities.getConnectedNodesSize(Node nodes)
Edge	Node.getEdgeTo(Node target)	Returns the edge from this node to target.
abstract de.grogra.imp2d.layout.DrawingEdgeTypeProperties	EdgeBasedLayout.getEdgeTypeProperties(Node nodes)	Getting a List of all edgeTypes and their directions
de.grogra.imp2d.layout.DrawingEdgeTypeProperties	EdgeBasedLayout2.getEdgeTypeProperties(Node nodes)	Getter for the list of edge types
de.grogra.imp2d.layout.DrawingEdgeTypeProperties	SimpleEdgeBasedLayout.getEdgeTypeProperties(Node nodes)	Getter for all edge types of the graph and their directions
protected Vector2d	Layout.Algorithm.getGlobalMaxBounds(Node nodes)	Getting the highest value (absolute) of height and width of the nodes
protected Vector2d	Layout.Algorithm.getGlobalMaxCoordinates(Node nodes)	Getting the most differing x- and y-coordinates from point (0,0)
protected Vector2d	Layout.Algorithm.getGlobalMaxCoordinates(Node nodes, Node rootNode)	Getting the most differing x- and y-coordinates (absolute) from rootNode
protected Vector2d	Layout.Algorithm.getGlobalMaxDistances(Node nodes)	Getting the longest distance (absolute) from nodes of the graph
Node	Edge.getNeighbor(Node n)	Returns the neighbor of n.
Edge	Edge.getNext(Node parent)	Returns the next edge in parent's list of edges
int	GraphUtilities.getNodeCount(Node nodes)	Returns the number of nodes of the graph
LinkedList	GraphUtilities.getNodesList(Node nodes)
LinkedList	GraphUtilities.getNodesListDFS(Node nodes)	Getting all nodes converted to a linked list and arranged in depth first search-style
LinkedList	GraphUtilities.getRoots(Node nodes)
LinkedList	GraphUtilities.getUnconnectedNodes(Node nodes)	Dividing the nodes of the graph into connectedNodes (= nodes that have edges to other nodes) and unconnectedNodes (= nodes that don't have edges to other nodes of the graph)
final void	Layout.Algorithm.invokeLayout(Layout layout, Node nodes)	Delegates layouting to another layout.
boolean	GraphUtilities.isNodeAccessed(Node nodeTemp)	checks if a node is marked or unmarked
boolean	HierarchyLayout.isNodeAccessed(Node nodeTemp)	checks if a node is marked or unmarked
protected void	ForceBasedLayout.FBAlgorithm.layout(Node nodes)
protected void	ForceBasedLayout2.FBAlgorithm2.layout(Node nodes)
protected void	HierarchyLayout.HAlgorithm.layout(Node nodes)
protected abstract void	Layout.Algorithm.layout(Node nodes)	This method has to be implemented to perform the layout.
protected abstract Point2d	ForceBasedLayout2.repellingForce(Node firstNode, Node secondNode)	Calculating the repelling force of two nodes
void	GraphUtilities.setAllEdgesAccessed(Node nodeList, boolean value)
void	HierarchyLayout.setAllEdgesAccessed(Node nodeList, boolean value)
void	GraphUtilities.setAllNodesEdgesAccessed(Node nodeList, boolean value)
void	HierarchyLayout.setAllNodesEdgesAccessed(Node nodeList, boolean value)
void	GraphUtilities.setNodeAccessed(Node nodeTemp, boolean value)	Setting a concrete Node marked or unmarked
void	HierarchyLayout.setNodeAccessed(Node nodeTemp, boolean value)	Setting a concrete Node marked or unmarked
protected void	DavidsonHarelLayout.setRandomPosition(Node nodeTemp, Random rnd)	Calculating the inital positions of the nodes
protected void	EadesLayout.setRandomPosition(Node nodeTemp, Random rnd)	Calculating the inital positions of the nodes
protected abstract void	ForceBasedLayout.setRandomPosition(Node nodeTemp, Random rnd)
protected abstract void	ForceBasedLayout2.setRandomPosition(Node nodeTemp, Random rnd)	Calculating the inital positions of the nodes
protected void	FruchtermanReingoldLayout.setRandomPosition(Node nodeTemp, Random rnd)	Calculating and setting the inital positions of the nodes
protected void	SpringLayout.setRandomPosition(Node nodeTemp, Random rnd)
protected abstract Point2d	ForceBasedLayout2.springForce(Node firstNode, Node secondNode)	Calculating the spring force of two nodes