edmonds-karp, dijkstra search, kruskal mst, floyd-warshall, bellman-ford, tarjans least common ancestor, danzig's simplex method, etc. are all algos that were p

edmonds-karp, dijkstra search, kruskal mst, floyd-warshall, bellman-ford, tarjans least common ancestor, danzig's simplex method, etc. are all algos that were paper pubs throughout last century, covered in CLRS i.e. good undergrad algos class, and come up in interview style questions.