Classic algorithms - is the topic interesting?

Good day!



Recently, I come across a large number of various classical algorithms (both during classes at the university and in practice in projects), so I want to share with the habra community interesting materials on this topic. I think that not everyone here knows what algorithms are being discussed, but it is quite possible that they could be useful to you.

In a recent post: “The Maximum Flow of the Minimum Cost” suggested me to try to describe each of these classical algorithms separately and in detail.

That is, to give a description of each algorithm, along with its computational complexity and areas of application.



What do I mean by "classic algorithms":

BFS, DFS, Min Spanning Tree (Prim, ..), Shortest Path (Dijkstra, BF) and many others. These are the basic algorithms that are studied in the course on algorithms and then widely used in various fields.

')

Therefore, the actual question is whether to cover this topic here or not?

Thanks in advance for the comments!