#help basics graph theory
5 messages · Page 1 of 1 (latest)
<@&286206848099549185>
<@&286206848099549185>
use dijkstra’s algorithm and find the path from o to i. like, i to a then a-b, etc and from then keep going from there on
No need for anything fancy. Just try all the possibilities and rule one out whenever you find one that's better in one spot.