Algebraic graph algorithms. A practical guide using Python (Q2240967)

The master's course ``Algorithms on graphs and networks'' has become almost mandatory at most universities in the computer science department. The refereed manual may be the basis of such a course, including both lectures and practical training. The book is divided into two parts. The list of the sections of the first part of the book consists of a Short review of Python; Basics matrix computations; Graphs, matrices, and matroids; Parallel and sparse matrix computations. This part of the book can make up the content of the lecture part of the course. The second part of the book ``Graph algorithms'' consists of the following sections: Trees; Shortest paths; Connectivity and matching; Subgraph search; Large graph analysis; Graph partitioning and clustering. In the reviewer's opinion, this part of the book can make up the content a practical part of the course ``Algorithms on graphs and networks''. The practical part can be implemented not only in Python.