Uses of Class
de.grogra.imp2d.layout.Node
Packages that use Node
-
Uses of Node in de.grogra.imp2d.layout
Fields in de.grogra.imp2d.layout declared as NodeModifier and TypeFieldDescriptionfinal NodeNode.nextThe next node in the linked list of all nodes.final NodeEdge.sourceThe source node of this edge.final NodeEdge.targetThe target node of this edge.Methods in de.grogra.imp2d.layout that return NodeMethods in de.grogra.imp2d.layout with parameters of type NodeModifier and TypeMethodDescriptionprotected VectorForceBasedLayout2.FBAlgorithm2.allocationNodes(Node nodeTemp, Vector vNodes) protected voidForceBasedLayout2.FBAlgorithm2.applyVectorToNode(Node nodeTemp, Point2d diff, double delta) protected voidDavidsonHarelLayout.computeForce(Node s, Node t, Vector2f force) Computes the repelling force of two nodes s and tprotected voidEadesLayout.computeForce(Node s, Node t, Vector2f force) Comnputes the repelling force of two nodes s and tprotected abstract voidForceBasedLayout.computeForce(Node s, Node t, Vector2f force) Computes the force contribution of a pair of nodes.protected voidFruchtermanReingoldLayout.computeForce(Node s, Node t, Vector2f force) Calculating the repelling force of two nodes s and tprotected voidSpringLayout.computeForce(Node s, Node t, Vector2f force) protected voidLayout.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 zoomingGraphUtilities.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 intGraphUtilities.getConnectedNodesSize(Node nodes) Returns the edge from this node totarget.abstract de.grogra.imp2d.layout.DrawingEdgeTypePropertiesEdgeBasedLayout.getEdgeTypeProperties(Node nodes) Getting a List of all edgeTypes and their directionsde.grogra.imp2d.layout.DrawingEdgeTypePropertiesEdgeBasedLayout2.getEdgeTypeProperties(Node nodes) Getter for the list of edge typesde.grogra.imp2d.layout.DrawingEdgeTypePropertiesSimpleEdgeBasedLayout.getEdgeTypeProperties(Node nodes) Getter for all edge types of the graph and their directionsprotected Vector2dLayout.Algorithm.getGlobalMaxBounds(Node nodes) Getting the highest value (absolute) of height and width of the nodesprotected Vector2dLayout.Algorithm.getGlobalMaxCoordinates(Node nodes) Getting the most differing x- and y-coordinates from point (0,0)protected Vector2dLayout.Algorithm.getGlobalMaxCoordinates(Node nodes, Node rootNode) Getting the most differing x- and y-coordinates (absolute) from rootNodeprotected Vector2dLayout.Algorithm.getGlobalMaxDistances(Node nodes) Getting the longest distance (absolute) from nodes of the graphEdge.getNeighbor(Node n) Returns the neighbor ofn.Returns the next edge inparent's list of edgesintGraphUtilities.getNodeCount(Node nodes) Returns the number of nodes of the graphGraphUtilities.getNodesList(Node nodes) GraphUtilities.getNodesListDFS(Node nodes) Getting all nodes converted to a linked list and arranged in depth first search-styleGraphUtilities.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 voidLayout.Algorithm.invokeLayout(Layout layout, Node nodes) Delegates layouting to anotherlayout.booleanGraphUtilities.isNodeAccessed(Node nodeTemp) checks if a node is marked or unmarkedbooleanHierarchyLayout.isNodeAccessed(Node nodeTemp) checks if a node is marked or unmarkedprotected voidprotected voidprotected voidprotected abstract voidThis method has to be implemented to perform the layout.protected abstract Point2dForceBasedLayout2.repellingForce(Node firstNode, Node secondNode) Calculating the repelling force of two nodesvoidGraphUtilities.setAllEdgesAccessed(Node nodeList, boolean value) voidHierarchyLayout.setAllEdgesAccessed(Node nodeList, boolean value) voidGraphUtilities.setAllNodesEdgesAccessed(Node nodeList, boolean value) voidHierarchyLayout.setAllNodesEdgesAccessed(Node nodeList, boolean value) voidGraphUtilities.setNodeAccessed(Node nodeTemp, boolean value) Setting a concrete Node marked or unmarkedvoidHierarchyLayout.setNodeAccessed(Node nodeTemp, boolean value) Setting a concrete Node marked or unmarkedprotected voidDavidsonHarelLayout.setRandomPosition(Node nodeTemp, Random rnd) Calculating the inital positions of the nodesprotected voidEadesLayout.setRandomPosition(Node nodeTemp, Random rnd) Calculating the inital positions of the nodesprotected abstract voidForceBasedLayout.setRandomPosition(Node nodeTemp, Random rnd) protected abstract voidForceBasedLayout2.setRandomPosition(Node nodeTemp, Random rnd) Calculating the inital positions of the nodesprotected voidFruchtermanReingoldLayout.setRandomPosition(Node nodeTemp, Random rnd) Calculating and setting the inital positions of the nodesprotected voidSpringLayout.setRandomPosition(Node nodeTemp, Random rnd) protected abstract Point2dForceBasedLayout2.springForce(Node firstNode, Node secondNode) Calculating the spring force of two nodes