C++ Data Structures from Scratch
by Robert MacGregor
Home >>
Vol. 1 >>
Vol. 2 >>
Vol. 3.1 >>
[ Vol. 3.2 ] >>
Purchase >>
More
Volume 3.2
Building upon the previous book in the series, C++ Data Structures from Scratch, Vol. 3.2 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:
-
85 complete source code files, with detailed line-by-line analysis and diagrams
-
20 sample programs directly illustrating key concepts from each chapter
-
Online support
Major topics:
- Networks
- Maximum flow (Floyd-Fulkerson Algorithm)
- Maximum flow of minimum cost (Dijkstra-Ford Algorithm)
- Matching algorithms
- Bipartite
- Stable (Gale-Shapley)
- Perfect minimum-weight (Hungarian)
- Data compression (Huffman coding)
- Memory allocation
- String matching algorithms
- Brute force
- Knuth-Morris-Pratt
- Levenshtein distance
- ASCII and binary file I/O
Cover illustration:
Convergence
by Mark J. Brady
Preview
Click here to download a preview of
Volume 3.2, which includes the following:
- Front and back covers
- Table of Contents
- Introduction and Getting Started
- Full text of Chapter 7.1 ("Brute Force String Matching")
- Source code
Source Code Download
Click here for details on how to obtain the required source
code.
Next Page: Purchase
Back to Top