You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Replaced Dijkstra with BFS for shortest path finding in graph traversal, since all edge weights are uniform (1). Added Lloyd relaxation as a "Uniformity" slider to both Voronoi shape and effect.
12
4
13
5
**Performance improvement:**
14
6
~200x faster path finding (BFS O(V+E) vs old Dijkstra with O(n) priority queue)
0 commit comments