Collecting some of the most popular graph algorithms and optimization procedures, A Java Library of Graph Algorithms and Optimization provides the source code for a library of Java programs that can be used to solve problems in graph theory and combinatorial optimization. Self-sufficient and very independent, each topic starts with a description of the problem and outline a solution procedure, followed by its parameter list specification, source code, and test examples that illustrate the use of the code. The book begins with a chapter on random graph generation that examines bipartite, regular, connected, Hamilton, and isomorphic graphs and cover, labeled, and unlabeled rooted trees. The next chapters deal with graph coloring, graph matching, network flow, and packing and covering, including the assignment, bottleneck assignment, quadratic assignment, multiple knapsack, set covering and set partitioning problems.