Algorithms in JavaIn these volumes, Robert Sedgewick focuses on practical applications, giving readers all the information, diagrams and real code they need to confidently implement, debug and use the algorithms he presents. |
Contents
Graph Properties and Types | 3 |
Graph Search | 81 |
Digraphs and DAGS | 149 |
Copyright | |
4 other sections not shown
Other editions - View all
Algorithms in Java: Graph algorithms, Part 5 Robert Sedgewick,Michael Schidlowsky No preview available - 2003 |
Common terms and phrases
acyclic networks adjacency lists adjacency matrix adjacency-lists representation adjacency-matrix representation AdjList all-pairs shortest-paths applications augmenting paths augmenting-path basic Bellman-Ford algorithm boolean capacity Chapter client connected component consider corresponding cost data structures defined dense graphs Develop DFS forest DFS tree digraph Dijkstra's algorithm edge connecting edge weights efficient eligible edge Euclidean Euler tour example flow network fringe graph ADT graph algorithms Graph G graph-processing problems graph-search implementation integers interface kernel DAG length linear maxflow problem method mincost mincost-flow problem MST algorithm negative cycles network simplex nodes number of edges number of vertices operation pair of vertices performance preflow-push Prim's algorithm priority-queue private int Program proportional queue reachable recursive reduces residual network rithms Section self-loops shortest paths shortest-paths problem single-source solution solve spanning tree sparse graphs strong components subgraph topological sort transitive closure tree edges undirected graphs vertex-indexed array worst-case