Home
last modified time | relevance | path

Searched refs:startVertex (Results 1 – 25 of 809) sorted by relevance

12345678910>>...33

/dports/cad/sumo/sumo-1.2.0/tools/assign/
H A Dassign.py39 if startVertex._id != endVertex._id and getlinkChoices:
50 while vertex != startVertex:
55 odIndex = odPairsMap[startVertex._id][endVertex._id]
67 AssignedTrip[startVertex][endVertex] += demand
86 for start, startVertex in enumerate(startVertices):
91 ODPaths = net._paths[startVertex][endVertex]
233 for start, startVertex in enumerate(startVertices):
235 foutpath.write('\norigin=%s, ' % startVertex)
242 ODPaths = net._paths[startVertex][endVertex]
289 while AssignedVeh[startVertex][endVertex] < int(round(AssignedTrip[startVertex][endVertex])):
[all …]
H A Dnetwork.py73 for startVertex in self._startVertices:
74 self._paths[startVertex] = {}
76 self._paths[startVertex][endVertex] = []
79 for startVertex in self._startVertices:
81 self._paths[startVertex][endVertex] = []
192 for start, startVertex in enumerate(startVertices):
200 D, P = dijkstraPlain(startVertex, endSet)
202 D, P = dijkstra(startVertex, endSet)
213 while vertex != startVertex:
259 updatedVertices = [startVertex]
[all …]
H A Doutputs.py136 for startVertex in startVertices:
137 foutmtx.write('%s ' % startVertex.label)
139 for start, startVertex in enumerate(startVertices):
141 foutmtx.write('\n* from: %s\n' % startVertex.label)
161 for start, startVertex in enumerate(startVertices):
163 if startVertex.label != endVertex.label and matrixPshort[start][end] > 0.:
165 startVertex.label][endVertex.label]
167 % (startVertex.label, endVertex.label,
H A DAssignment.py50 for start, startVertex in enumerate(startVertices):
51 odPairsMap[startVertex.label] = {}
130 for start, startVertex in enumerate(net._startVertices):
131 AssignedVeh[startVertex] = {}
132 AssignedTrip[startVertex] = {}
135 AssignedVeh[startVertex][endVertex] = 0
136 AssignedTrip[startVertex][endVertex] = 0.
232 for start, startVertex in enumerate(startVertices):
245 net._boostGraph, startVertex.boost)
247 D, P = dijkstraPlain(startVertex, targets)
[all …]
/dports/java/jgraphx/jgraphx-4.2.2/src/com/mxgraph/analysis/
H A DmxTraversal.java105 Object[] q = { startVertex, null }; in bfs()
107 queued.add(startVertex); in bfs()
196 distances[vertexListStatic.indexOf(startVertex)] = 0; in dijkstra()
279 while (currVertex != startVertex) in dijkstra()
320 distanceMap.put(startVertex, 0.0); in bellmanFord()
321 parentMap.put(startVertex, startVertex); in bellmanFord()
498 if (startVertex != targetVertex) in getWFIPath()
503 currPath.add(startVertex); in getWFIPath()
505 while (startVertex != targetVertex) in getWFIPath()
508 startVertex = result.get(result.size() - 1); in getWFIPath()
[all …]
/dports/www/firefox-legacy/firefox-52.8.0esr/gfx/skia/skia/src/gpu/
H A DGrMesh.h17 int startVertex() const { return fStartVertex; } in startVertex() function
49 void init(GrPrimitiveType primType, const GrBuffer* vertexBuffer, int startVertex, in init() argument
53 SkASSERT(startVertex >= 0); in init()
57 fStartVertex = startVertex; in init()
70 int startVertex, in initIndexed() argument
79 SkASSERT(startVertex >= 0); in initIndexed()
83 fStartVertex = startVertex; in initIndexed()
100 int startVertex, in initInstanced() argument
110 SkASSERT(startVertex >= 0); in initInstanced()
114 fStartVertex = startVertex; in initInstanced()
/dports/math/latte-integrale/latte-version_1_7_6/code/latte/buildPolytopes/
H A DGraphMaker.cpp292 void GraphMaker::makePetersenSubGraph(const int startVertex) in makePetersenSubGraph() argument
294 for(int i = startVertex; i < startVertex + 4; ++i) in makePetersenSubGraph()
296 edges[startVertex].push_back(startVertex + 4); in makePetersenSubGraph()
298 for(int i = startVertex; i < startVertex + 5; ++i) in makePetersenSubGraph()
300 for(int i = startVertex + 5; i < startVertex + 8; ++i) in makePetersenSubGraph()
302 for(int i = startVertex + 5; i < startVertex + 7; ++i) in makePetersenSubGraph()
/dports/cad/sumo/sumo-1.2.0/tools/net/
H A DodConnectionsCheck.py130 if startVertex.label not in skipList and endVertex.label not in skipList:
134 (startVertex.label, endVertex.label, matrixEntry))
266 for startVertex in net._startVertices:
267 if startVertex.label == elem:
268 startVertices.append(startVertex)
334 for start, startVertex in enumerate(startVertices):
335 if startVertex not in separateZones:
338 print("checking start vertex", startVertex.label)
339 D, P = dijkstraPlain(startVertex, targets)
342 if startVertex.label != endVertex.label and endVertex not in separateZones:
[all …]
/dports/graphics/wdune/wdune-1.926/src/
H A DNodeIndexedFaceSet.cpp2695 Vec3f startVertex = in insetFaces() local
2822 newVertex = startVertex; in insetFaces()
2830 newVertex = startVertex; in insetFaces()
2838 newVertex = startVertex; in insetFaces()
2935 newVertex = startVertex; in insetFaces()
2943 newVertex = startVertex; in insetFaces()
2951 newVertex = startVertex; in insetFaces()
2962 Vec3f startVertex = in insetFaces() local
3019 newVertex = startVertex; in insetFaces()
3027 newVertex = startVertex; in insetFaces()
[all …]
/dports/games/libretro-scummvm/scummvm-7b1e929/engines/sword25/math/
H A Dpolygon.cpp295 const Vertex &startVertex = vertices[startVertexIndex]; in isLineInCone() local
299 if (Line::isVertexLeftOn(prevVertex, startVertex, nextVertex)) { in isLineInCone()
301 return Line::isVertexLeftOn(endVertex, startVertex, nextVertex) && in isLineInCone()
302 Line::isVertexLeftOn(startVertex, endVertex, prevVertex); in isLineInCone()
304 return Line::isVertexLeft(endVertex, startVertex, nextVertex) && in isLineInCone()
305 Line::isVertexLeft(startVertex, endVertex, prevVertex); in isLineInCone()
308 return !(Line::isVertexLeft(endVertex, startVertex, prevVertex) && in isLineInCone()
309 Line::isVertexLeft(startVertex, endVertex, nextVertex)); in isLineInCone()
311 return !(Line::isVertexLeftOn(endVertex, startVertex, prevVertex) && in isLineInCone()
312 Line::isVertexLeftOn(startVertex, endVertex, nextVertex)); in isLineInCone()
/dports/games/scummvm/scummvm-2.5.1/engines/sword25/math/
H A Dpolygon.cpp295 const Vertex &startVertex = vertices[startVertexIndex]; in isLineInCone() local
299 if (Line::isVertexLeftOn(prevVertex, startVertex, nextVertex)) { in isLineInCone()
301 return Line::isVertexLeftOn(endVertex, startVertex, nextVertex) && in isLineInCone()
302 Line::isVertexLeftOn(startVertex, endVertex, prevVertex); in isLineInCone()
304 return Line::isVertexLeft(endVertex, startVertex, nextVertex) && in isLineInCone()
305 Line::isVertexLeft(startVertex, endVertex, prevVertex); in isLineInCone()
308 return !(Line::isVertexLeft(endVertex, startVertex, prevVertex) && in isLineInCone()
309 Line::isVertexLeft(startVertex, endVertex, nextVertex)); in isLineInCone()
311 return !(Line::isVertexLeftOn(endVertex, startVertex, prevVertex) && in isLineInCone()
312 Line::isVertexLeftOn(startVertex, endVertex, nextVertex)); in isLineInCone()
/dports/science/cdk/cdk-cdk-2.3/legacy/src/main/java/org/openscience/cdk/graph/
H A DBFSShortestPath.java50 public static List<Edge> findPathBetween(Graph graph, Object startVertex, Object endVertex) { in findPathBetween() argument
51 MyBreadthFirstIterator iter = new MyBreadthFirstIterator(graph, startVertex); in findPathBetween()
85 public MyBreadthFirstIterator(Graph g, Object startVertex) { in MyBreadthFirstIterator() argument
86 super(g, startVertex); in MyBreadthFirstIterator()
/dports/graphics/vpaint/vpaint-1.7/src/Gui/VectorAnimationComplex/
H A DProperPath.cpp73 KeyVertex * firstVertex = firstHalfedge.startVertex(); // hence this is a valid vertex in ProperPath()
80 if((*it)->startVertex() == lastVertex) in ProperPath()
95 else if((*it)->startVertex() == firstVertex) in ProperPath()
120 if(halfedges_.last().endVertex() == halfedges_.first().startVertex()) in ProperPath()
132 KeyVertex * vertex = he.startVertex(); in ProperPath()
H A DSmartKeyEdgeSet.cpp183 Vertex * startVertex = edge->startVertex(); // not NULL because edge is open in SmartKeyEdgeSet() local
184 … SubVertex * leftSubVertex = vertexToSubVertex.value(startVertex, 0); // returns 0 if not found in SmartKeyEdgeSet()
187 leftSubVertex = new SubVertex(startVertex); in SmartKeyEdgeSet()
189 vertexToSubVertex[startVertex] = leftSubVertex; in SmartKeyEdgeSet()
H A DCycleHelper.cpp170 …KeyVertex * startVertex = iedge->startVertex(); // we know it's not null since we rejected pure lo… in CycleHelper() local
171 Vertex * leftNode = vertexToNode.value(startVertex, 0); // returns 0 if not found in CycleHelper()
174 leftNode = new Vertex(startVertex); in CycleHelper()
176 vertexToNode[startVertex] = leftNode; in CycleHelper()
458 if(loop(i)[j].startVertex()) in cells()
459 res << loop(i)[j].startVertex(); in cells()
465 res << path(i)[0].startVertex(); in cells()
H A DAlgorithms.cpp191 if( (e1->startVertex() == e2->startVertex()) || in areIncident()
192 (e1->startVertex() == e2->endVertex()) || in areIncident()
193 (e1->endVertex() == e2->startVertex()) || in areIncident()
H A DPath.cpp74 … if( (halfedges_[i].isClosed()) || (halfedges_[i].endVertex() != halfedges_[i+1].startVertex()) ) in Path()
132 … KeyVertex * firstVertex = halfedges_.first().startVertex(); // hence this is a valid vertex in Path()
140 if((*it)->startVertex() == lastVertex) in Path()
170 else if((*it)->startVertex() == firstVertex) in Path()
302 res << he.startVertex() << he.edge; in cells()
314 KeyVertex * Path::startVertex() const in startVertex() function in VectorAnimationComplex::Path
324 return halfedges_.first().startVertex(); in startVertex()
/dports/graphics/graphviz/graphviz-2.44.1/lib/neatogen/
H A Dbfs.h38 } void initQueue(int startVertex) { in initQueue() argument
39 data[0] = startVertex; in initQueue()
78 extern void initQueue(Queue *, int startVertex);
/dports/graphics/opensubdiv/OpenSubdiv-3_4_4/opensubdiv/osd/
H A DclVertexBuffer.h59 void UpdateData(const float *src, int startVertex, int numVertices, cl_command_queue clQueue,
63 void UpdateData(const float *src, int startVertex, int numVertices,
66 …UpdateData(src, startVertex, numVertices, context->GetCommandQueue(), startEvents, numStartEvents,…
H A DclGLVertexBuffer.h65 void UpdateData(const float *src, int startVertex, int numVertices,
69 void UpdateData(const float *src, int startVertex, int numVertices, in UpdateData() argument
71 UpdateData(src, startVertex, numVertices, context->GetCommandQueue()); in UpdateData()
H A DglVertexBuffer.cpp59 GLVertexBuffer::UpdateData(const float *src, int startVertex, int numVertices, in UpdateData() argument
66 startVertex * _numElements * sizeof(float), in UpdateData()
73 startVertex * _numElements * sizeof(float), size, src); in UpdateData()
H A DclD3D11VertexBuffer.h78 void UpdateData(const float *src, int startVertex, int numVertices,
83 void UpdateData(const float *src, int startVertex, int numVertices, in UpdateData() argument
85 UpdateData(src, startVertex, numVertices, context->GetCommandQueue()); in UpdateData()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/skia/src/gpu/mock/
H A DGrMockOpTarget.h37 int* startVertex) override { in makeVertexSpace() argument
42 *startVertex = 0; in makeVertexSpace()
47 sk_sp<const GrBuffer>*, int* startVertex, in makeVertexSpaceAtLeast() argument
53 *startVertex = 0; in makeVertexSpaceAtLeast()
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Filtering/ImageIntensity/include/
H A DitkPolylineMask2DImageFilter.hxx114 VertexType startVertex; in GenerateData() local
166 startVertex = tmpVertex; in GenerateData()
169 outputImagePtr->TransformPhysicalPointToIndex(startVertex, startImageIndex); in GenerateData()
213 startVertex = tmpVertex; in GenerateData()
216 outputImagePtr->TransformPhysicalPointToIndex(startVertex, startImageIndex); in GenerateData()
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/meshlabplugins/filter_geodesic/
H A Dfilter_geodesic.cpp122 CMeshO::VertexPointer startVertex=0; in applyFilter() local
127 startVertex=&*vi; in applyFilter()
132 …f %f %f",startPoint[0],startPoint[1],startPoint[2],startVertex->P()[0],startVertex->P()[1],startVe… in applyFilter()
137 tri::Geodesic<CMeshO>::Compute(m.cm, vector<CVertexO*>(1,startVertex),dd,dist_thr); in applyFilter()

12345678910>>...33