Home
last modified time | relevance | path

Searched refs:adjEdges (Results 1 – 23 of 23) sorted by relevance

/dports/graphics/opensubdiv/OpenSubdiv-3_4_4/opensubdiv/far/
H A DptexIndices.cpp93 int adjFaces[4], int adjEdges[4]) const { in GetAdjacency()
110 adjEdges[i] = 0; in GetAdjacency()
117 assert(adjEdges[i]!=-1); in GetAdjacency()
122 adjEdges[i] = 3; in GetAdjacency()
129 adjEdges[3] = 0; in GetAdjacency()
159 adjEdges[1] = 2; in GetAdjacency()
162 adjEdges[2] = 1; in GetAdjacency()
170 adjEdges[0] = 0; in GetAdjacency()
179 adjEdges[0] = 3; in GetAdjacency()
189 adjEdges[3]=0; in GetAdjacency()
[all …]
H A DptexIndices.h86 int adjFaces[4], int adjEdges[4]) const;
/dports/math/ogdf/OGDF/src/ogdf/decomposition/
H A DPlanarSPQRTree.cpp85 adjEdges[vT].clear(); in adoptEmbedding()
104 adjEdges[vT].pushBack(adj); in setPosInEmbedding()
181 adjEdges); in embed()
185 G.sort(vOrig,adjEdges); in embed()
216 adjEdges.pushBack(adjOrig); in expandVirtualEmbed()
224 adjEdges); in expandVirtualEmbed()
260 adjEdges); in createInnerVerticesEmbed()
264 G.sort(vOrig,adjEdges); in createInnerVerticesEmbed()
358 SList<adjEntry> adjEdges; in randomEmbed() local
361 adjEdges.pushBack(adj); in randomEmbed()
[all …]
/dports/math/ogdf/OGDF/src/ogdf/uml/
H A DPlanRepUML.cpp214 SList<edge> adjEdges; in expand() local
217 adjEdges.pushBack(e); in expand()
222 edge e = adjEdges.popFrontRet(); in expand()
227 adjEdges.pushBack(e); in expand()
228 e = adjEdges.popFrontRet(); in expand()
357 SList<edge> adjEdges; in expand() local
360 adjEdges.pushBack(e); in expand()
365 edge e = adjEdges.popFrontRet(); in expand()
465 SList<edge> adjEdges; in expandLowDegreeVertices() local
584 List<edge> adjEdges; in collapseVertices() local
[all …]
/dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/lib/CodeGen/PBQP/
H A DGraph.h59 AdjEdgeList adjEdges; variable
67 AdjEdgeItr edgesBegin() { return adjEdges.begin(); } in edgesBegin()
68 AdjEdgeItr edgesEnd() { return adjEdges.end(); } in edgesEnd()
71 return adjEdges.insert(adjEdges.end(), e); in addEdge()
75 adjEdges.erase(ae); in removeEdge()
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/examples/advanced/
H A DExtrudePoly.cpp142 Range adjEdges; in main() local
143 rval = mb->get_adjacencies(edgeVerts, 2, 1, false, adjEdges); MB_CHK_ERR(rval); in main()
144 if (adjEdges.size()<1) in main()
146 indexEdges[i]=edges.index(adjEdges[0]); in main()
/dports/math/ogdf/OGDF/include/ogdf/decomposition/
H A DPlanarSPQRTree.h147 NodeArray<SListPure<adjEntry> > &adjEdges,
157 SListPure<adjEntry> &adjEdges);
/dports/math/ogdf/OGDF/src/ogdf/planarity/
H A DPlanRep.cpp410 SList<edge> adjEdges; in expand() local
413 adjEdges.pushBack(e); in expand()
417 edge e = adjEdges.popFrontRet(); in expand()
443 for (edge ei : adjEdges) in expand()
496 SList<edge> adjEdges; in expand() local
499 adjEdges.pushBack(e); in expand()
504 edge e = adjEdges.popFrontRet(); in expand()
529 for (edge ei : adjEdges) in expand()
574 SList<edge> adjEdges; in expandLowDegreeVertices() local
583 adjEdges.pushBack(adj->theEdge()); in expandLowDegreeVertices()
[all …]
/dports/math/ogdf/OGDF/src/ogdf/basic/
H A DGraph.cpp153 internal::GraphList<AdjElement> &adjEdges = vG->adjEntries; in copy() local
154 for (AdjElement *adjG = adjEdges.head(); adjG; adjG = adjG->succ()) { in copy()
272 SListPure<edge> adjEdges; in constructInitByNodes() local
286 adjEdges.pushBack(adjG->m_edge); in constructInitByNodes()
291 for (edge eG : adjEdges) in constructInitByNodes()
360 SListPure<edge> adjEdges; in constructInitByActiveNodes() local
378 adjEdges.pushBack(adjG->m_edge); in constructInitByActiveNodes()
389 for (edge eG : adjEdges) in constructInitByActiveNodes()
887 internal::GraphList<AdjElement> &adjEdges = v->adjEntries; in delNode() local
889 while((adj = adjEdges.head()) != nullptr) in delNode()
/dports/math/ogdf/OGDF/src/ogdf/energybased/multilevel_mixer/
H A DMultilevelGraph.cpp604 std::vector<edge> adjEdges; in moveEdgesToParent() local
607 adjEdges.push_back(adj->theEdge()); in moveEdgesToParent()
611 for (edge e : adjEdges) in moveEdgesToParent()
622 for (edge e : adjEdges) in moveEdgesToParent()
/dports/math/ogdf/OGDF/src/ogdf/graphalg/
H A DConnectivityTester.cpp62 v->adjEdges(edges); in restrictNodes()
/dports/lang/v8/v8-9.6.180.12/tools/turbolizer/src/
H A Dgraph-view.ts748 const adjEdges = visibleEdges.filter(e => e.target === node || e.source === node); constant
749 adjEdges.attr('relToHover', "none");
750 … const adjNodes = adjEdges.data().map(e => e.target).concat(adjEdges.data().map(e => e.source));
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/tools/turbolizer/src/
H A Dgraph-view.ts748 const adjEdges = visibleEdges.filter(e => e.target === node || e.source === node); constant
749 adjEdges.attr('relToHover', "none");
750 … const adjNodes = adjEdges.data().map(e => e.target).concat(adjEdges.data().map(e => e.source));
/dports/www/chromium-legacy/chromium-88.0.4324.182/v8/tools/turbolizer/src/
H A Dgraph-view.ts748 const adjEdges = visibleEdges.filter(e => e.target === node || e.source === node); constant
749 adjEdges.attr('relToHover', "none");
750 … const adjNodes = adjEdges.data().map(e => e.target).concat(adjEdges.data().map(e => e.source));
/dports/multimedia/opentoonz/opentoonz-1.5.0/toonz/sources/tnztools/
H A Dplastictool_meshedit.cpp342 const int(&adjEdges)[2] = vertexOccurrences[vIdx].m_adjacentEdgeIdx; in buildEdgeCuts() local
343 int eIdx = (adjEdges[0] == lastCut.m_eIdx) ? adjEdges[1] : adjEdges[0]; in buildEdgeCuts()
/dports/math/ogdf/OGDF/test/src/basic/
H A Dgraph.cpp273 v->adjEdges(edges); in __anonab0991db0402()
613 s->adjEdges(edges); in __anonab0991db0402()
621 t->adjEdges(edges); in __anonab0991db0402()
736 v->adjEdges(edges); in __anonab0991db0402()
H A Dgenerators.cpp78 v->adjEdges(vEdges); in assertCirculant()
/dports/math/ogdf/OGDF/src/ogdf/layered/
H A DLongestPathRanking.cpp294 w->adjEdges(edges); in join()
/dports/math/ogdf/OGDF/doc/porting/
H A Dcatalpa.md167 `NodeElement::adjEdges` was renamed to `NodeElement::adjEntries`.
168 This means you have to change `for(adjEntry adj : v->adjEdges)` to `for(adjEntry adj : v->adjEntrie…
173 * `adjEdges()`
/dports/math/ogdf/OGDF/include/ogdf/cluster/
H A DClusterGraph.h647 void adjEdges(cluster c, EDGELIST &edges) const { in adjEdges() function
/dports/math/ogdf/OGDF/include/ogdf/basic/
H A DGraph_d.h244 void adjEdges(EDGELIST &edgeList) const { in adjEdges() function
/dports/math/ogdf/OGDF/src/ogdf/energybased/davidson_harel/
H A DUniformGrid.cpp318 v->adjEdges(incident); in UniformGrid()
/dports/math/ogdf/OGDF/src/ogdf/basic/graph_generators/
H A Drandomized.cpp1500 v->adjEdges(vEdges); in randomWattsStrogatzGraph()