This book is devoted to an in-depth study of all the fundamental concepts and algorithms that undoubtedly fall into the category of 'eternal'. Having carefully studied them, you will receive knowledge that will never become outdated and which you will always use.

Conciseness, accuracy, accuracy, relevance, abundance of examples and training tasks - this is just a small list of the obvious advantages of the book. Illustration of algorithms in one of the most effective programming languages once again emphasizes their popularity and “eternity”. The widest range of fundamental algorithms on graphs is considered in detail, including: search in digraphs, non-digraphs and networks; construction of minimum spanning trees and shortest paths; calculation of flows in networks with different characteristics. Much attention is paid to the performance characteristics of the algorithms, as well as their mathematical derivation.

The book can be used as a course of lectures (by both students and teachers), a reference manual, or simply a 'novel', while getting nothing incomparable pleasure.