Home  >>  Vol. 1  >>  Vol. 2  >>  [ Vol. 3.1 ]  >>  Vol. 3.2  >>  Purchase  >>  More

Volume 3.1

Building upon the second book in the series, C++ Data Structures from Scratch, Vol. 3.1 is a comprehensive guide to creating fully functional, STL-style implementations of more advanced data structures and algorithms, introducing new and powerful C++ language concepts along the way.

Key features:

• 190+ complete source code files, with detailed line-by-line analysis and diagrams


• 50+ sample programs directly illustrating key concepts from each chapter


• Online support

Major topics:

• Tries (speed-optimized)
• Compressed tries (memory-optimized)
• Disjoint sets
• Tables
• Graphs


• Pathfinding algorithms
• Dijkstra
• Bellman-Ford
• Floyd-Warshall
• Cycle detection


• Connectivity algorithms
• Kruskal (minimum spanning tree)
• Tarjan-Hopcroft (articulation points, biconnected components)
• Kosaraju, Tarjan (strongly connected components)


• Dependency analysis (topological sort)


• ASCII file input
• Exception handling

Cover illustration: ConcentriCity by Mark J. Brady

Preview

Click here to download a preview of Volume 3.1, which includes the following:

• Front and back covers
• Table of Contents
• Introduction and Getting Started
• Full text of Chapter 3.1 ("Introducing the DisjointSet Class")
• Source code

Source Code Download

Click here for details on how to obtain the required source code.

Next Page: Vol. 3.2

Back to Top