# Classic algorithms - is the topic interesting?

Good afternoon!

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

In a recent post: “Maximum Low Cost Flow” led me to try to describe each of these classic algorithms separately and in detail.

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

What do I mean by "classical 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 are widely used in various fields.

Therefore, the actual question is, is it worth covering this topic here or not?

Thanks in advance for your comments!

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

In a recent post: “Maximum Low Cost Flow” led me to try to describe each of these classic algorithms separately and in detail.

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

What do I mean by "classical 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 are widely used in various fields.

Therefore, the actual question is, is it worth covering this topic here or not?

Thanks in advance for your comments!