The book "Algorithms and programs for solving problems on graphs and networks" by Nechepurenko M. and . , Popkova V. K. , Mainasheva S. M. and others represents an important work in computer science and graph theory. This publication will become an indispensable assistant for students, graduate students, teachers, as well as for professionals working in the field of information technology and related fields. If you are interested in algorithms, programming and solving complex problems, this book will surely attract your attention. At the heart of the book is an in-depth analysis of graphs and networks, which are the basis of many modern technologies. The authors offer the reader not only a theoretical justification, but also practical examples of the use of various algorithms. They consider in detail such important aspects as the search for the shortest paths, minimal spanning trees, flows in networks and much more. Each chapter is filled with examples that help to better understand how theoretical concepts are applied in practice. This makes the book not just a textbook, but a real tool for solving real problems. Who can like this publication? First of all, students and graduate students studying computer science, mathematics or related disciplines . The book will be useful for those who are preparing for exams, as well as for those who want to deepen their knowledge in the field of algorithms and data structures. Teachers will find in it a lot of materials for the preparation of lectures and seminars . In addition, professionals working in areas such as software development, data analysis and process optimization will also find useful ideas and solutions here. The topics raised in the book cover a wide range of topics related to graphs and networks. The authors discuss not only algorithms, but also their effectiveness, which is an important aspect in the face of growing data volumes and program performance requirements. The book also touches on the complexity of algorithms, which allows the reader to better understand how to choose suitable methods for solving specific problems. These aspects make the publication relevant and in demand in the modern world, where information is becoming an increasingly important resource. The style of the authors is distinguished by clarity and accessibility, which makes complex concepts understandable even for beginners. They use many illustrations and graphs, which helps to visualize ideas and facilitates the perception of the material. This is especially important for readers who are just beginning to get acquainted with graph theory. In addition, the authors actively use examples from real practice, which makes the material more lively and interesting. If you are looking for books on algorithms, programming or graph theory, then Algorithms and problem solving programs on graphs and networks will be an excellent choice. It can be the basis for your further study of this fascinating field, as well as inspire new ideas and projects. Do not miss the opportunity to immerse yourself in the world of algorithms and networks, which opens up limitless horizons for research and practical applications.