#### Overview of this book

C++ is a mature multi-paradigm programming language that enables you to write high-level code with a high degree of control over the hardware. Today, significant parts of software infrastructure, including databases, browsers, multimedia frameworks, and GUI toolkits, are written in C++. This book starts by introducing C++ data structures and how to store data using linked lists, arrays, stacks, and queues. In later chapters, the book explains the basic algorithm design paradigms, such as the greedy approach and the divide-and-conquer approach, which are used to solve a large variety of computational problems. Finally, you will learn the advanced technique of dynamic programming to develop optimized implementations of several algorithms discussed in the book. By the end of this book, you will have learned how to implement standard data structures and algorithms in efficient and scalable C++ 14 code.
Free Chapter
1. Lists, Stacks, and Queues
2. Trees, Heaps, and Graphs
3. Hash Tables and Bloom Filters
4. Divide and Conquer
5. Greedy Algorithms
6. Graph Algorithms I
7. Graph Algorithms II
8. Dynamic Programming I
9. Dynamic Programming II

## Summary

We covered three major graph problems in this chapter: first, the graph traversal problem for which two solutions were introduced, breadth-first search (BFS) and depth-first search (DFS). Second, we revisited the minimum spanning tree (MST) problem and solved it using Prim's algorithm. We also compared it with Kruskal's algorithm and discussed the conditions under which one should be preferred over the other. Finally, we introduced the single-source shortest path problem, which finds a minimum-cost shortest path in graphs, and covered Dijkstra's shortest path algorithm.

However, Dijkstra's algorithm only works for graphs with positive edge weights. In the next chapter, we shall seek to relax this constraint and introduce a shortest path algorithm that can handle negative edge weights. We shall also generalize the shortest path problem to find the shortest paths between all the pairs of vertices in graphs.