Wednesday, March 24, 2010
Algorithms in Java, Part 5: Graph Algorithms
Do you like this story?
Addison-Wesley Professional | ISBN: 0201361213| edition 2003 | CHM | 528 pages | 10,3 MB
Text provides a tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications. Covers graph properties and types; digraphs and DAGs; minimum spanning trees; shortest paths; network flows; and diagrams, sample Java code, and detailed algorithm descriptions. Softcover.
This post was written by: Franklin Manuel
Franklin Manuel is a professional blogger, web designer and front end web developer. Follow him on Twitter
Subscribe to:
Post Comments (Atom)
0 Responses to “Algorithms in Java, Part 5: Graph Algorithms”
Post a Comment