Printer Friendly

A Java library of graph algorithms and optimization.


A Java library of graph algorithms and optimization.

Lau, Hang T.

Chapman & Hall/CRC


386 pages



Discrete mathematics and its applications


Lau (McGill University) provides the source code for 60 Java programs that implement some of the most popular graph algorithms and mathematical programming procedures. The parameters and an example are provided for each program, most of which address random graph generation, connectivity, paths, cycles, and assignment problems. The code on the CD-ROM has been tested in Java 2 platform standard edition development kit 5.0 with Windows XP.

([c]20072005 Book News, Inc., Portland, OR)
COPYRIGHT 2007 Book News, Inc.
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2007 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Publication:SciTech Book News
Article Type:Book Review
Date:Mar 1, 2007
Previous Article:Guide to hard milling and high speed machining.
Next Article:Introduction to mixed modelling; beyond regression and analysis of variance.

Related Articles
Java-based visualisation and numerical analysis tools. (Tools).
Parallel Architectures, Algorithms, and Networks: Proceedings.
Graphs and discovery; proceedings.
Parallel combinatorial optimization.
Field-programmable custom computing machines; proceedings.
Discrete mathematics.
Algorithms and tools for parallel computing on heterogeneous clusters.
A practical guide to data structures and algorithms using Java. (CD-ROM included).
How to Think About Algorithms.

Terms of use | Privacy policy | Copyright © 2021 Farlex, Inc. | Feedback | For webmasters |