|
Free ebooks
 Free programing ebooks Java Algorithms in Java, Third Edition, Part 5: Graph Algorithms
|
 This book, Algorithms in Java, Third Edition, Part 5: Graph Algorithms, contains six chapters that cover graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks. The descriptions here are intended to give readers an understanding of the basic properties of as broad a range of fundamental graph algorithms as possible.Chapter 17. Graph Properties and Types In this chapter, we examine basic properties of graphs in detail, setting the stage for us to study a variety of algorithms that are useful for answering questions of the type just posed. Chapter 18. Graph Search In this chapter, we consider the fundamental graph-search algorithms that we use to move through graphs, learning their structural properties as we go. Chapter 19. Digraphs and DAGs In this chapter, we revisit, in the context of digraphs, a subset of the basic graph-processing problems that we considered in Chapter 17, and we examine several problems that are specific to digraphs. Chapter 20. Minimum Spanning Trees We work exclusively with undirected graphs in this chapter. The problem of finding a minimum-weight directed spanning tree in a digraph is different, and is more difficult. Chapter 21. Shortest Paths Chapter 22. Network Flow In this chapter, we extend the network problem-solving model to encompass a dynamic situation where we imagine material flowing through the network, with different costs attached to different routes. Download free ebooks on JAVA: Algorithms in Java, Third Edition, Part 5: Graph Algorithms
|
