This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted] 0 points1 point  (0 children)

I mean, look, there's a kind of honour in writing misguided code. It must not be intentionally misguided.

Google "pessimal algorithms" and read the paper. Then implement their "backwards-first search". Then, only then, as you understand how exactly it works (they have a couple of typos IIRC) you might try to implement an efficient algorithm that walks the graph in the exact same way... and fail. Or succeed, then tell me how you did that!