Algorithms in C++.: Graph algorithms
Algorithms in C++ contains exercises to help students learn the properties of algorithms with a greater emphasis on abstract data types, modular programming, object oriented programming and C++ classes.
What people are saying - Write a review
LibraryThing ReviewUser Review - jeffober - LibraryThing
"A Gentle Introduction..." is an important foundational text, introducing themes like functional programming, recursion, and symbols. While the topics it covers are often quite basic, everyone must ... Read full review
Other editions - View all
A.beg A.end A.nxt acyclic networks adjacency lists adjacency matrix adjacency-matrix representation applications augmenting paths augmenting-path basic capacity Chapter client connected component consider const 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 &G graph ADT graph algorithms graph-processing problems graph-search implementation integers interface kernel DAG Kruskal's algorithm length linear maxflow problem member function method mincost mincost-flow problem MST algorithm negative cycles network simplex nodes number of edges number of vertices pair of vertices performance preflow-push Prim's algorithm priority-queue Program queue reachable reduces residual network Section self-loops shortest paths shortest-paths problem single-source sink solution solve spanning tree sparse graphs strong components style of Figure subgraph template class Graph topological sort transitive closure tree edges undirected graphs vertex-indexed vector worst-case