Searched refs:minVertexIndex (Results 1 – 8 of 8) sorted by relevance
496 minVertexIndex = INVALID497 while minVertexIndex == INVALID:498 (minVertexDistance, minVertexIndex) = heapq.heappop(distance)500 distanceArray[minVertexIndex] = minVertexDistance501 del(distanceDict[minVertexIndex])502 notVisited[minVertexIndex] = False 506 minVertexIndex = int(minVertexIndex)507 cols = numpy.array(neighbourIndices[minVertexIndex])508 weights = numpy.array(neighbourWeights[minVertexIndex])
960 minVertexIndex = INVALID961 while minVertexIndex == INVALID:962 (minVertexDistance, minVertexIndex) = heapq.heappop(distance)964 distanceArray[minVertexIndex] = minVertexDistance965 del(distanceDict[minVertexIndex])966 notVisited[minVertexIndex] = False 970 minVertexIndex = int(minVertexIndex)971 cols = neighbourIndices[minVertexIndex]972 weights = neighbourWeights[minVertexIndex]
134 int minVertexIndex = -1; in Rpo_computeMinEdgeCost() local148 minVertexIndex = minVertex; in Rpo_computeMinEdgeCost()149 } else if ((edgeCost == minCost) && minVertex < minVertexIndex) { in Rpo_computeMinEdgeCost()152 minVertexIndex = minVertex; in Rpo_computeMinEdgeCost()
466 int minVertexIndex = -1; in findIntersectionNearest() local480 minVertexIndex = i; in findIntersectionNearest()487 *outVertexIndex = minVertexIndex; in findIntersectionNearest()490 return minVertexIndex != -1; in findIntersectionNearest()
467 int minVertexIndex = -1; in findIntersectionNearest() local481 minVertexIndex = i; in findIntersectionNearest()488 *outVertexIndex = minVertexIndex; in findIntersectionNearest()491 return minVertexIndex != -1; in findIntersectionNearest()
82 …long __stdcall DrawIndexedPrimitiveUP(D3DPRIMITIVETYPE type, unsigned int minVertexIndex, unsigned…
141 …long __stdcall DrawIndexedPrimitiveUP(D3DPRIMITIVETYPE type, unsigned int minVertexIndex, unsigned…
85 …long __stdcall DrawIndexedPrimitiveUP(D3DPRIMITIVETYPE type, unsigned int minVertexIndex, unsigned…