A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and Its Applications)
2008-12-08 20:26
621 查看
版权声明:原创作品,允许转载,转载时请务必以超链接形式标明文章原始出版、作者信息和本声明。否则将追究法律责任。http://blog.csdn.net/topmvp - topmvp
Because of its portability and platform-independence, Java is the ideal computer programming language to use when working on graph algorithms and other mathematical programming problems. 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-contained and largely independent, each topic starts with a problem description and an outline of the solution procedure, followed by its parameter list specification, source code, and a test example that illustrates the usage of the code. The book begins with a chapter on random graph generation that examines bipartite, regular, connected, Hamilton, and isomorphic graphs as well as spanning, labeled, and unlabeled rooted trees. It then discusses connectivity procedures, followed by a paths and cycles chapter that contains the Chinese postman and traveling salesman problems, Euler and Hamilton cycles, and shortest paths. The author proceeds to describe two test procedures involving planarity and graph isomorphism. Subsequent 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. The final chapters explore linear, integer, and quadratic programming. The appendices provide references that offer further details of the algorithms and include the definitions of many graph theory terms used in the book. http://rapidshare.com/files/64592046/1584887184.rar http://depositfiles.com/files/2146434
Because of its portability and platform-independence, Java is the ideal computer programming language to use when working on graph algorithms and other mathematical programming problems. 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-contained and largely independent, each topic starts with a problem description and an outline of the solution procedure, followed by its parameter list specification, source code, and a test example that illustrates the usage of the code. The book begins with a chapter on random graph generation that examines bipartite, regular, connected, Hamilton, and isomorphic graphs as well as spanning, labeled, and unlabeled rooted trees. It then discusses connectivity procedures, followed by a paths and cycles chapter that contains the Chinese postman and traveling salesman problems, Euler and Hamilton cycles, and shortest paths. The author proceeds to describe two test procedures involving planarity and graph isomorphism. Subsequent 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. The final chapters explore linear, integer, and quadratic programming. The appendices provide references that offer further details of the algorithms and include the definitions of many graph theory terms used in the book. http://rapidshare.com/files/64592046/1584887184.rar http://depositfiles.com/files/2146434
相关文章推荐
- Apache Ant -a java library and command-line tool for building different types of applications
- 【转载】Step by Step Creation of Crystal Report using its Features Group, Graph, Cross-Tab and Sub Report
- (Page 1 of 3 )A walking tour of JavaBeans What JavaBeans is, how it works, and why you want to use it
- (Page 2 of 3 )A walking tour of JavaBeans 2 :What JavaBeans is, how it works, and why you want to use it
- 稀疏表示综述:A Survey of Sparse Representation: Algorithms and Applications_2015(1)
- (Page 3 of 3 )A walking tour of JavaBeans What JavaBeans is, how it works, and why you want to use it
- Wireless J2ME Applications with Java and Bluetooth - Part 2 of 2 @ JDJ
- 稀疏表示综述:A Survey of Sparse Representation: Algorithms and Applications_2015(1)
- Running Spark GraphX algorithms on Library of Congress subject heading SKOS
- Effective Use of Microsoft Enterprise Library: Building Blocks for Creating Enterprise Applications and Services (Microsoft .Net
- Running Apache Spark GraphX algorithms on Library of Congress subject heading SKOS
- 稀疏表示综述:A Survey of Sparse Representation: Algorithms and Applications_2015(2)
- Garbage Collection Optimization for High-Throughput and Low-Latency Java Applications--转载
- 稀疏表示综述:A Survey of Sparse Representation: Algorithms and Applications_2015(2)
- Its width is W and height is H. As a result, if the font size of characters is S then it can only sh
- Computer Vision: Algorithms and Applications 计算机视觉:算法与应用 翻译工作 序
- Eclipse.Rich.Client.Platform.Designing.Coding.and.Packaging.Java.Applications 翻译
- Debugging native framework code of Android Java applications
- Java Performance Optimization Tools and Techniques for Turbocharged Apps--reference
- Building Applications with Force.com and VisualForce (DEV401) (二二):Visualforce Componets (Tags) Library Part II