Home
last modified time | relevance | path

Searched refs:newEdge (Results 1 – 25 of 527) sorted by relevance

12345678910>>...22

/dports/math/ogdf/OGDF/src/ogdf/simultaneous/
H A DSimDrawCreatorSimple.cpp58 e = m_G->newEdge(v0,v[i]); in createTrees_GKV05()
82 e = m_G->newEdge(v[1],v[2]); in createPathPlanar_EK04()
85 e = m_G->newEdge(v[1],v[3]); in createPathPlanar_EK04()
89 e = m_G->newEdge(v[1],v[4]); in createPathPlanar_EK04()
92 e = m_G->newEdge(v[1],v[5]); in createPathPlanar_EK04()
95 e = m_G->newEdge(v[1],v[6]); in createPathPlanar_EK04()
98 e = m_G->newEdge(v[2],v[3]); in createPathPlanar_EK04()
309 e = m_G->newEdge(a,b); in createKrat98()
312 e = m_G->newEdge(b,nodeC); in createKrat98()
347 e = m_G->newEdge(a,p[0]); in createKrat98()
[all …]
/dports/math/ogdf/OGDF/test/src/graphalg/
H A Dmin-st-cut.cpp33 graph.newEdge(s, v1); in describeMSTCutFromMaxFlowSuite()
34 graph.newEdge(v2, t); in describeMSTCutFromMaxFlowSuite()
135 graph.newEdge(v2, v4); in describeMSTCutSuite()
136 graph.newEdge(v2, v5); in describeMSTCutSuite()
137 graph.newEdge(v1, v3); in describeMSTCutSuite()
139 graph.newEdge(v5, t); in describeMSTCutSuite()
140 graph.newEdge(v4, t); in describeMSTCutSuite()
141 graph.newEdge(v3, t); in describeMSTCutSuite()
159 graph.newEdge(s, v1); in describeMSTCutSuite()
160 graph.newEdge(s, v2); in describeMSTCutSuite()
[all …]
/dports/math/ogdf/OGDF/src/ogdf/basic/graph_generators/
H A Ddeterministic.cpp116 G.newEdge(v[i],v[j]); in completeGraph()
142 G.newEdge(u, v); in completeKPartiteGraph()
166 G.newEdge(center, n2); in wheelGraph()
168 G.newEdge(n1, n2); in wheelGraph()
173 G.newEdge(n1, n0); in wheelGraph()
187 G.newEdge(n0,v); in suspension()
223 else G.newEdge(last,cur); in gridGraph()
230 G.newEdge(last, first); in gridGraph()
250 G.newEdge(outn,inn); in petersenGraph()
253 else G.newEdge(last,outn); in petersenGraph()
[all …]
H A Doperations.cpp96 product.newEdge(srcInProduct, in cartesianProduct()
105 product.newEdge(srcInProduct, in cartesianProduct()
121 product.newEdge( in tensorProduct()
141 product.newEdge(srcInProduct, in lexicographicalProduct()
151 product.newEdge(srcInProduct, in lexicographicalProduct()
168 product.newEdge(srcInProduct, in strongProduct()
176 product.newEdge(srcInProduct, in strongProduct()
186 product.newEdge(srcInProduct, in strongProduct()
205 product.newEdge(srcInProduct, in coNormalProduct()
216 product.newEdge(srcInProduct, in coNormalProduct()
[all …]
/dports/math/ogdf/OGDF/test/src/planarity/
H A Dplanarity.cpp197 graph.newEdge(t, s); in testNonPlanarCore()
200 graph.newEdge(s, v); in testNonPlanarCore()
201 graph.newEdge(v, t); in testNonPlanarCore()
215 graph.newEdge(x, w); in testNonPlanarCore()
354 graph.newEdge(*v.get(0), *v.get(1)); in testNonPlanarCore()
355 graph.newEdge(*v.get(1), *v.get(2)); in testNonPlanarCore()
356 graph.newEdge(*v.get(2), *v.get(4)); in testNonPlanarCore()
357 graph.newEdge(*v.get(1), *v.get(3)); in testNonPlanarCore()
358 graph.newEdge(*v.get(4), *v.get(3)); in testNonPlanarCore()
359 graph.newEdge(*v.get(3), *v.get(5)); in testNonPlanarCore()
[all …]
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/algo/phy_tree/fastme/
H A Dgraph.cpp92 meEdge *newEdge; in makeEdge() local
94 strcpy(newEdge->label,label); in makeEdge()
95 newEdge->tail = tail; in makeEdge()
96 newEdge->head = head; in makeEdge()
97 newEdge->distance = weight; in makeEdge()
98 newEdge->totalweight = 0.0; in makeEdge()
99 return(newEdge); in makeEdge()
173 meEdge *newEdge; in copyEdge() local
175 newEdge->topsize = e->topsize; in copyEdge()
176 newEdge->bottomsize = e->bottomsize; in copyEdge()
[all …]
/dports/math/ogdf/OGDF/src/ogdf/fileformats/
H A DGraphIO_hyper.cpp95 shell->pushBack( G.newEdge(si,so) ); in readBENCH()
111 if(shell) shell->pushBack( G.newEdge(si,n) ); in readBENCH()
118 if(shell) shell->pushBack( G.newEdge(n,so) ); in readBENCH()
132 G.newEdge(in,out); in readBENCH()
150 G.newEdge(in,out); in readBENCH()
153 G.newEdge(mm,m); in readBENCH()
192 G.newEdge(in,outport[i]); in readPLA()
200 G.newEdge(outport[from],in); in readPLA()
209 shell->pushBack( G.newEdge(si,so) ); in readPLA()
214 shell->pushBack( G.newEdge( si, n ) ); in readPLA()
[all …]
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/tools/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java142 markAsNew(newEdge); in createDiff()
143 newEdges.add(newEdge); in createDiff()
144 graph.addEdge(newEdge); in createDiff()
157 markAsDeleted(newEdge); in createDiff()
158 newEdges.add(newEdge); in createDiff()
159 graph.addEdge(newEdge); in createDiff()
161 newEdges.remove(newEdge); in createDiff()
162 graph.removeEdge(newEdge); in createDiff()
163 markAsSame(newEdge); in createDiff()
164 newEdges.add(newEdge); in createDiff()
[all …]
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/tools/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java142 markAsNew(newEdge); in createDiff()
143 newEdges.add(newEdge); in createDiff()
144 graph.addEdge(newEdge); in createDiff()
157 markAsDeleted(newEdge); in createDiff()
158 newEdges.add(newEdge); in createDiff()
159 graph.addEdge(newEdge); in createDiff()
161 newEdges.remove(newEdge); in createDiff()
162 graph.removeEdge(newEdge); in createDiff()
163 markAsSame(newEdge); in createDiff()
164 newEdges.add(newEdge); in createDiff()
[all …]
/dports/graphics/py-pandana/pandana-0.6.1/src/contraction_hierarchies/src/Contractor/
H A DContractor.h349 Edge newEdge; in GetEdges() local
350 newEdge.source = node; in GetEdges()
351 newEdge.target = target; in GetEdges()
356 newEdge.data.type = -1; in GetEdges()
363 newEdge.data.forward = data.forward; in GetEdges()
365 edges.push_back( newEdge ); in GetEdges()
501 _ImportEdge newEdge; variable
502 newEdge.source = source;
503 newEdge.target = target;
505 newEdge.data.forward = true;
[all …]
/dports/math/R-cran-lpSolve/lpSolve/src/
H A Dlp_pricePSE.c346 newEdge = &(lp->edgeVector[targetcol]); in updatePricer()
347 *newEdge += (hold*hold) * cEdge; in updatePricer()
349 if((*newEdge) > DEVEX_RESTARTLIMIT) { in updatePricer()
355 *newEdge -= 2*hold*vEdge[i]; in updatePricer()
359 if(*newEdge <= 0) { in updatePricer()
440 newEdge = &(lp->edgeVector[i]); in updatePricer()
441 *newEdge += (hold*hold) * cEdge; in updatePricer()
443 if((*newEdge) > DEVEX_RESTARTLIMIT) { in updatePricer()
449 *newEdge -= 2*hold*vEdge[i]; in updatePricer()
451 SETMAX(*newEdge, hold*hold+1); in updatePricer()
[all …]
/dports/math/lp_solve/lp_solve_5.5/
H A Dlp_pricePSE.c346 newEdge = &(lp->edgeVector[targetcol]); in updatePricer()
347 *newEdge += (hold*hold) * cEdge; in updatePricer()
349 if((*newEdge) > DEVEX_RESTARTLIMIT) { in updatePricer()
355 *newEdge -= 2*hold*vEdge[i]; in updatePricer()
359 if(*newEdge <= 0) { in updatePricer()
444 newEdge = &(lp->edgeVector[i]); in updatePricer()
445 *newEdge += (hold*hold) * cEdge; in updatePricer()
447 if((*newEdge) > DEVEX_RESTARTLIMIT) { in updatePricer()
453 *newEdge -= 2*hold*vEdge[i]; in updatePricer()
455 SETMAX(*newEdge, hold*hold+1); in updatePricer()
[all …]
/dports/cad/opencascade/opencascade-7.6.0/src/TopOpeBRepBuild/
H A DTopOpeBRepBuild_makeedges.cxx101 TopoDS_Shape newEdge; in GEDBUMakeEdges() local
110 myBuildTool.CopyEdge(EF,newEdge); in GEDBUMakeEdges()
133 TopExp_Explorer exE(newEdge,TopAbs_VERTEX); in GEDBUMakeEdges()
150 Standard_Real parVE = BRep_Tool::Parameter(TopoDS::Vertex(VE),TopoDS::Edge(newEdge)); in GEDBUMakeEdges()
168 myBuildTool.AddEdgeVertex(newEdge,V); in GEDBUMakeEdges()
169 myBuildTool.Parameter(newEdge,V,parV); in GEDBUMakeEdges()
177 …TopTools_ListOfShape loe; Standard_Boolean ok = TopOpeBRepTool_TOOL::SplitE(TopoDS::Edge(newEdge),… in GEDBUMakeEdges()
181 if (!tosplit) LOE.Append(newEdge); in GEDBUMakeEdges()
/dports/games/openrct2/OpenRCT2-0.3.5.1/src/openrct2/actions/
H A DWallPlaceAction.cpp151 uint8_t newEdge = (_edge + 2) & 3; in Query() local
154 if (surfaceElement->GetSlope() & (1 << newEdge)) in Query()
164 newEdge = (newEdge - 1) & 3; in Query()
166 if (surfaceElement->GetSlope() & (1 << newEdge)) in Query()
168 newEdge = (newEdge + 2) & 3; in Query()
169 if (surfaceElement->GetSlope() & (1 << newEdge)) in Query()
184 newEdge = (_edge + 3) & 3; in Query()
185 if (surfaceElement->GetSlope() & (1 << newEdge)) in Query()
195 newEdge = (newEdge - 1) & 3; in Query()
197 if (surfaceElement->GetSlope() & (1 << newEdge)) in Query()
[all …]
/dports/databases/pgrouting/pgrouting-3.2.0/src/trsp/
H A DGraphDefinition.cpp602 newEdge->m_vecStartConnectedEdge.clear(); in addEdge()
603 newEdge->m_vecEndConnedtedEdge.clear(); in addEdge()
604 newEdge->m_vecRestrictedEdge.clear(); in addEdge()
605 newEdge->m_lEdgeID = edgeIn.id; in addEdge()
607 newEdge->m_lStartNode = edgeIn.source; in addEdge()
608 newEdge->m_lEndNode = edgeIn.target; in addEdge()
609 newEdge->m_dCost = edgeIn.cost; in addEdge()
617 max_node_id = newEdge->m_lStartNode; in addEdge()
619 if (newEdge->m_lEndNode > max_node_id) { in addEdge()
620 max_node_id = newEdge->m_lEndNode; in addEdge()
[all …]
/dports/math/ogdf/OGDF/src/ogdf/cluster/
H A DCconnectClusterPlanar.cpp254 G.newEdge(correspond,newNode); in constructWheelGraph()
280 G.newEdge(correspond,newNode); in constructWheelGraph()
311 G.newEdge(hub,next); in constructWheelGraph()
312 G.newEdge(correspond,next); in constructWheelGraph()
320 G.newEdge(next,newNode); in constructWheelGraph()
331 G.newEdge(next,outgoingTable[f]); in constructWheelGraph()
342 G.newEdge(hub,next); in constructWheelGraph()
343 G.newEdge(pre,next); in constructWheelGraph()
351 G.newEdge(next,newNode); in constructWheelGraph()
359 G.newEdge(next,outgoingTable[f]); in constructWheelGraph()
[all …]
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/utils/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java216 markAsDeleted(newEdge); in createDiff()
217 newEdges.add(newEdge); in createDiff()
218 graph.addEdge(newEdge); in createDiff()
236 markAsNew(newEdge); in createDiff()
237 newEdges.add(newEdge); in createDiff()
238 graph.addEdge(newEdge); in createDiff()
240 newEdges.remove(newEdge); in createDiff()
241 graph.removeEdge(newEdge); in createDiff()
242 markAsSame(newEdge); in createDiff()
243 newEdges.add(newEdge); in createDiff()
[all …]
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/utils/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java216 markAsDeleted(newEdge); in createDiff()
217 newEdges.add(newEdge); in createDiff()
218 graph.addEdge(newEdge); in createDiff()
236 markAsNew(newEdge); in createDiff()
237 newEdges.add(newEdge); in createDiff()
238 graph.addEdge(newEdge); in createDiff()
240 newEdges.remove(newEdge); in createDiff()
241 graph.removeEdge(newEdge); in createDiff()
242 markAsSame(newEdge); in createDiff()
243 newEdges.add(newEdge); in createDiff()
[all …]
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/utils/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java216 markAsDeleted(newEdge); in createDiff()
217 newEdges.add(newEdge); in createDiff()
218 graph.addEdge(newEdge); in createDiff()
236 markAsNew(newEdge); in createDiff()
237 newEdges.add(newEdge); in createDiff()
238 graph.addEdge(newEdge); in createDiff()
240 newEdges.remove(newEdge); in createDiff()
241 graph.removeEdge(newEdge); in createDiff()
242 markAsSame(newEdge); in createDiff()
243 newEdges.add(newEdge); in createDiff()
[all …]
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/utils/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java216 markAsDeleted(newEdge); in createDiff()
217 newEdges.add(newEdge); in createDiff()
218 graph.addEdge(newEdge); in createDiff()
236 markAsNew(newEdge); in createDiff()
237 newEdges.add(newEdge); in createDiff()
238 graph.addEdge(newEdge); in createDiff()
240 newEdges.remove(newEdge); in createDiff()
241 graph.removeEdge(newEdge); in createDiff()
242 markAsSame(newEdge); in createDiff()
243 newEdges.add(newEdge); in createDiff()
[all …]
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/utils/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java216 markAsDeleted(newEdge); in createDiff()
217 newEdges.add(newEdge); in createDiff()
218 graph.addEdge(newEdge); in createDiff()
236 markAsNew(newEdge); in createDiff()
237 newEdges.add(newEdge); in createDiff()
238 graph.addEdge(newEdge); in createDiff()
240 newEdges.remove(newEdge); in createDiff()
241 graph.removeEdge(newEdge); in createDiff()
242 markAsSame(newEdge); in createDiff()
243 newEdges.add(newEdge); in createDiff()
[all …]
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/utils/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java216 markAsDeleted(newEdge); in createDiff()
217 newEdges.add(newEdge); in createDiff()
218 graph.addEdge(newEdge); in createDiff()
236 markAsNew(newEdge); in createDiff()
237 newEdges.add(newEdge); in createDiff()
238 graph.addEdge(newEdge); in createDiff()
240 newEdges.remove(newEdge); in createDiff()
241 graph.removeEdge(newEdge); in createDiff()
242 markAsSame(newEdge); in createDiff()
243 newEdges.add(newEdge); in createDiff()
[all …]
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/utils/IdealGraphVisualizer/Difference/src/com/sun/hotspot/igv/difference/
H A DDifference.java216 markAsDeleted(newEdge); in createDiff()
217 newEdges.add(newEdge); in createDiff()
218 graph.addEdge(newEdge); in createDiff()
236 markAsNew(newEdge); in createDiff()
237 newEdges.add(newEdge); in createDiff()
238 graph.addEdge(newEdge); in createDiff()
240 newEdges.remove(newEdge); in createDiff()
241 graph.removeEdge(newEdge); in createDiff()
242 markAsSame(newEdge); in createDiff()
243 newEdges.add(newEdge); in createDiff()
[all …]
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/utils/IdealGraphVisualizer/Difference/src/main/java/com/sun/hotspot/igv/difference/
H A DDifference.java216 markAsDeleted(newEdge); in createDiff()
217 newEdges.add(newEdge); in createDiff()
218 graph.addEdge(newEdge); in createDiff()
236 markAsNew(newEdge); in createDiff()
237 newEdges.add(newEdge); in createDiff()
238 graph.addEdge(newEdge); in createDiff()
240 newEdges.remove(newEdge); in createDiff()
241 graph.removeEdge(newEdge); in createDiff()
242 markAsSame(newEdge); in createDiff()
243 newEdges.add(newEdge); in createDiff()
[all …]
/dports/graphics/geos/geos-3.9.1/src/geomgraph/
H A DEdgeEnd.cpp55 EdgeEnd::EdgeEnd(Edge* newEdge) in EdgeEnd() argument
57 edge(newEdge), in EdgeEnd()
67 EdgeEnd::EdgeEnd(Edge* newEdge, const Coordinate& newP0, in EdgeEnd() argument
70 edge(newEdge), in EdgeEnd()
81 EdgeEnd::EdgeEnd(Edge* newEdge, const Coordinate& newP0, in EdgeEnd() argument
84 edge(newEdge), in EdgeEnd()

12345678910>>...22