3 ms·
> I needed to implement a path-finding algorithm to draw connections routed around arbitrarily-placed boxes. linked list, binary tree, dijkstra's algo - which
by mkagenius 10y ago
> I needed to implement a path-finding algorithm to draw connections routed around arbitrarily-placed boxes.
linked list, binary tree, dijkstra's algo - which one did you use? Why did you not settle with a O(n^3) or worse brute force?