this post was submitted on 16 Dec 2024
12 points (100.0% liked)
NotAwfulTech
386 readers
4 users here now
a community for posting cool tech news you don’t want to sneer at
non-awfulness of tech is not required or else we wouldn’t have any posts
founded 1 year ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
day 18
bit of a breather episode
As long as you ensure A* / Dijkstra's (is there a functional difference if the edge weights are constant?) you'll get the shortest path. Part 2 was just simulation for me, if I started in the state of part 1 it took a minute to run through the rest of the bytes.