Java 19: more algorithms and data structures, software development

The current book is the nineteenth in this series of books on software development in Java, and it is a continuation of the previous book. The book provides examples of algorithm paradigms including classic algorithms. In addition, several other data structures are described, including the implementation of a red-black binary tree. General trees are also treated in the form of a B-tree and a B+ tree and they are implemented as Java classes. A large part of the book is deals with graphs, including how a graph can be implemented as a class in Java. In addition, classic graph algorithms are described and implemented such as Dijkstra’s algorithm and Prim’s algorithm. The book ends with a chapter that introduces the traveling salesman problem, primarily as an example of an algorithm, where one does not know any solution that can be used in practice.