Uses of Class
jdg.graph.Node
Packages that use Node
-
Uses of Node in Unnamed Package
Fields in Unnamed Package declared as NodeModifier and TypeFieldDescriptionSpringDrawing.selectedNodenode selected with mouse click (to show)Methods in Unnamed Package that return NodeModifier and TypeMethodDescriptionSpringDrawing.selectNode(int i, int j) Select the vertex whose 2d projection is the closest to pixel (i, j)Methods in Unnamed Package with parameters of type NodeModifier and TypeMethodDescriptionJcg.geometry.Vector_2FR91Layout.computeAttractiveForce(Node u) Jcg.geometry.Vector_2FR91Layout.computeRepulsiveForce(Node u) voidSpringDrawing.drawVertex(Node u, double distortion, double maxDistortion) Draw a vertex u on the canvasvoidSpringDrawing.drawVertexLabel(Node u) Draw a vertex label on the canvas (close to the node location)SpringDrawing.getVertexLabel(Node u) Compute the label of a vertex, from its index, spectral distortion and vertex agevoidFR91Layout.repulsiveForce(Node u, Jcg.geometry.Vector_2[] disp) Compute the resultant of all repulsive forces acting on node 'u'.Jcg.geometry.Vector_2FR91Layout.slowRepulsiveForce(Node u) -
Uses of Node in jdg.graph
Modifier and TypeFieldDescriptionEdge.firstextremities of the edgeEdge.secondextremities of the edgeModifier and TypeFieldDescriptionAdjacencyListGraph.neighborsfor each node, store the list of neighborsNode.neighborslist of neighbors of the current nodeModifier and TypeMethodDescriptionAdjacencyListGraph.getNode(int index) Return the node given its index (between [0..n-1])Modifier and TypeMethodDescriptionAdjacencyListGraph.findConnectedComponent(Node v) Compute and return the connected component containing the vertex v It performs a DFS visit of the graph starting from vertex vAdjacencyListGraph.getNeighbors(Node v) Node.neighborsList()Return the list of neighboring nodesModifier and TypeMethodDescriptionvoidAdd an edge between two nodesvoidNode.addNeighbor(Node v) voidAdd a new node to the graph.booleanCheck whether two nodes are adjacent (slow implementation, without hash maps)booleanintReturn the degree of a nodeAdjacencyListGraph.findConnectedComponent(Node v) Compute and return the connected component containing the vertex v It performs a DFS visit of the graph starting from vertex vintAdjacencyListGraph.getEdgeIndex(Node a, Node b) Return the index of the edge having extremities (a, b) if any.AdjacencyListGraph.getNeighbors(Node v) voidAdjacencyListGraph.removeEdge(Node a, Node b) Remove the edge between two nodesvoidNode.removeNeighbor(Node v) voidAdjacencyListGraph.removeNode(Node v)