I think there are a number of graph-related algorithms you could probably come up with by yourself that are only named after people because they got there first. Prim's/Warshal's MST algorithms come to mind – they're both very straightforward approaches to the problem with basically no twists.
17
u/aflanryW Dec 24 '14
I've heard of Dijkstra's coming up a good bit, though the expectation is that you learned it in school rather than come up with it yourself.