On: Graph Data Structure Interview Questions

[adrianratnapala]

The thing about Dijkstra's algorithm is that it't just the obvious one that you would think of if you had never been introduced to the problem before. I'm pretty sure I "invented" it myself at least twice, and then forgot it.

Kudos to Dijkstra for nailing it down, but I think we do students a disservice by invoking his name all the time, thus making it seem scary.

[setr → adrianratnapala]

>Kudos to Dijkstra for nailing it down, but I think we do students a disservice by invoking his name all the time, thus making it seem scary.

Ofc, going the other way, once they realize Djikstra's algo is simple makes every other named algo less scary

And finally they (hopefully) realize such naming is a stupid thing to be scared by and disregard it entirely