Dijkstra detection part is the same as dijkstra.py. If isRing is True, only verts on the shortest pathes between selected 3 verts will be mapped, otherwise all verts mapped.Now eF(evaluation function) is detachable. Choose one from distBtw…

It takes significant time to compute. hahaha... import bmesh import math class VDijkstra: def __init__(self, vert): self.id = vert.index self.v = vert self.bestParent = None self.dist2start = float('inf') self.distances = {} # init peers s…