/dports/java/jgraph/jgraph-java-5.13.0.4/src/com/jgraph/layout/graph/ |
H A D | JGraphSpringLayout.java | 251 double nodeDistance = Math.sqrt(deltaX*deltaX + deltaY*deltaY); in repulse() local 253 if (nodeDistance < 0.1) { in repulse() 254 nodeDistance = 0.1; in repulse() 261 / (nodeDistance * nodeDistance); in repulse() 275 double deltaNormX = deltaX / nodeDistance; in repulse() 277 double deltaNormY = deltaY / nodeDistance; in repulse()
|
/dports/java/jgraph/jgraph-java-5.13.0.4/src/com/jgraph/layout/tree/ |
H A D | JGraphCompactTreeLayout.java | 61 nodeDistance = 5.0; in JGraphCompactTreeLayout() 217 x = nodeDistance + levelDistance; in attachParent() 218 y2 = (h - t.width) / 2 - nodeDistance; in attachParent() 219 y1 = y2 + t.width + 2 * nodeDistance - h; in attachParent() 235 t.contour.upperTail = new PolyLine(t.height + 2 * nodeDistance, 0, null); in layoutLeaf() 237 t.contour.lowerTail = new PolyLine(0, -t.width - 2 * nodeDistance, null); in layoutLeaf() 238 t.contour.lowerHead = new PolyLine(t.height + 2 * nodeDistance, 0, in layoutLeaf() 255 sum = h = c.width + 2 * nodeDistance; in join() 261 h = c.width + 2 * nodeDistance; in join() 544 return nodeDistance; in getNodeBorder() [all …]
|
H A D | JGraphAbstractTreeLayout.java | 60 protected double nodeDistance = 20; field in JGraphAbstractTreeLayout 253 nodeDistance = distance; in setNodeDistance() 267 return nodeDistance; in getNodeDistance()
|
H A D | JGraphTreeLayout.java | 160 distance += nodeDistance; in join()
|
/dports/math/ogdf/OGDF/include/ogdf/layered/ |
H A D | OptimalHierarchyLayout.h | 99 double nodeDistance() const { in nodeDistance() function 104 void nodeDistance(double x) { in nodeDistance() function
|
H A D | OptimalHierarchyClusterLayout.h | 103 double nodeDistance() const { in nodeDistance() function 108 void nodeDistance(double x) { in nodeDistance() function
|
H A D | FastHierarchyLayout.h | 97 double nodeDistance() const { in nodeDistance() function 102 void nodeDistance(double dist) { in nodeDistance() function
|
H A D | FastSimpleHierarchyLayout.h | 120 double nodeDistance() const { in nodeDistance() function 125 void nodeDistance(double dist) { in nodeDistance() function
|
/dports/java/jgraphx/jgraphx-4.2.2/src/com/mxgraph/layout/ |
H A D | mxCompactTreeLayout.java | 68 protected int nodeDistance = 20; field in mxCompactTreeLayout 252 return nodeDistance; in getNodeDistance() 258 public void setNodeDistance(int nodeDistance) in setNodeDistance() argument 260 this.nodeDistance = nodeDistance; in setNodeDistance() 662 double x = nodeDistance + levelDistance; in attachParent() 663 double y2 = (height - node.width) / 2 - nodeDistance; in attachParent() 664 double y1 = y2 + node.width + 2 * nodeDistance - height; in attachParent() 680 double dist = 2 * nodeDistance; in layoutLeaf() 694 double dist = 2 * nodeDistance; in join()
|
/dports/astro/marble/marble-21.12.3/tools/shp2pn2/ |
H A D | shp2pn2.cpp | 72 qreal nodeDistance( const GeoDataCoordinates &A, const GeoDataCoordinates &B ) { in nodeDistance() function 93 … if ( ( nodeDistance( (*it), (*itAux) ) > epsilon ) || ( itAux == begin ) ) { // absolute nodes in getParentNodes() 111 … if ( ( nodeDistance( (*it), (*itAux) ) > epsilon ) || ( itAux == begin ) ) { // absolute nodes in printAllNodes() 115 for ( ; itAux2 != end && nodeDistance( (*it), (*itAux2) ) <= epsilon; ++itAux2 ) in printAllNodes()
|
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.jdt.core/org.eclipse.jdt.core.tests.model/workspace/Converter/src/test0536/ |
H A D | A.java | 113 int distance = NodeStatistics.nodeDistance(lastMove.node, node); in pickNode() 236 testDistance += NodeStatistics.nodeDistance(oldNode,node); in dumpMoves() 366 int distance = NodeStatistics.nodeDistance(lastMove.node, node); in pickNode() 489 testDistance += NodeStatistics.nodeDistance(oldNode,node); in dumpMoves()
|
/dports/astro/celestia-gtk/celestia-1.6.1/src/celengine/ |
H A D | dsooctree.cpp | 137 … double nodeDistance = (obsPosition - cellCenterPos).length() - scale * DSOOctree::SQRT3; // in processCloseObjects() local 139 if (nodeDistance > boundingRadius) in processCloseObjects()
|
H A D | staroctree.cpp | 159 float nodeDistance = (obsPosition - cellCenterPos).length() - scale * StarOctree::SQRT3; in processCloseObjects() local 161 if (nodeDistance > boundingRadius) in processCloseObjects()
|
/dports/astro/celestia/celestia-1.6.1/src/celengine/ |
H A D | dsooctree.cpp | 137 … double nodeDistance = (obsPosition - cellCenterPos).length() - scale * DSOOctree::SQRT3; // in processCloseObjects() local 139 if (nodeDistance > boundingRadius) in processCloseObjects()
|
H A D | staroctree.cpp | 159 float nodeDistance = (obsPosition - cellCenterPos).length() - scale * StarOctree::SQRT3; in processCloseObjects() local 161 if (nodeDistance > boundingRadius) in processCloseObjects()
|
/dports/graphics/qgis/qgis-3.22.3/src/gui/annotations/ |
H A D | qgsmaptoolmodifyannotation.cpp | 174 const double nodeDistance = thisNode.point().sqrDist( mapPoint ); in cadCanvasMoveEvent() local 175 if ( nodeDistance < currentNodeDistance ) in cadCanvasMoveEvent() 178 currentNodeDistance = nodeDistance; in cadCanvasMoveEvent() 282 const double nodeDistance = thisNode.point().sqrDist( mapPoint ); in cadCanvasPressEvent() local 283 if ( nodeDistance < currentNodeDistance ) in cadCanvasPressEvent() 286 currentNodeDistance = nodeDistance; in cadCanvasPressEvent()
|
/dports/net/ns3/ns-allinone-3.35/ns-3.35/examples/wireless/ |
H A D | wifi-multirate.cc | 132 uint32_t nodeDistance; member in Experiment 160 nodeDistance (30), in Experiment() 445 "DeltaX", DoubleValue (nodeDistance), in Run() 446 "DeltaY", DoubleValue (nodeDistance), in Run()
|
/dports/math/ogdf/OGDF/doc/examples/layout/ |
H A D | hierarchical.cpp | 30 ohl->nodeDistance(25.0); in main()
|
H A D | hierarchical-ranking.cpp | 43 ohl->nodeDistance(25.0); in main()
|
/dports/math/ogdf/OGDF/include/ogdf/upward/ |
H A D | LayerBasedUPRLayout.h | 114 fhl->nodeDistance(40.0); in LayerBasedUPRLayout()
|
/dports/math/ogdf/OGDF/src/ogdf/layered/ |
H A D | OptimalHierarchyLayout.cpp | 51 m_nodeDistance = ohl.nodeDistance(); in OptimalHierarchyLayout() 60 m_nodeDistance = ohl.nodeDistance(); in operator =()
|
H A D | OptimalHierarchyClusterLayout.cpp | 111 m_nodeDistance = ohl.nodeDistance(); in OptimalHierarchyClusterLayout() 123 m_nodeDistance = ohl.nodeDistance(); in operator =()
|
/dports/graphics/R-cran-visNetwork/visNetwork/man/ |
H A D | visPhysics.Rd | 58 \item{"nodeDistance"}{ : Number. Default to 100. This is the range of influence for the repulsion.} 67 \item{"nodeDistance"}{ : Number. Default to 120. This is the range of influence for the repulsion.}
|
/dports/textproc/opensearch-dashboards/opensearch-dashboards-1.2.0-linux-x64/plugins/observabilityDashboards/node_modules/vis-network/esnext/esm/ |
H A D | vis-network.min.js.map | 1 …nodeDistance = this.options.nodeDistance;\n\n // approximation constants\n const a = -2 / 3 …
|
/dports/textproc/opensearch-dashboards/opensearch-dashboards-1.2.0-linux-x64/plugins/observabilityDashboards/node_modules/vis-network/esnext/umd/ |
H A D | vis-network.min.js.map | 1 …nodeDistance = this.options.nodeDistance;\n\n // approximation constants\n const a = -2 / 3 …
|