You need to learn graph traversal (Dijkstra/BFS) or dynamic programming. He doesn't cover them. Final Thoughts Reading Peter Brass feels like having a grumpy, genius professor sitting next to you. He assumes you are smart, he doesn't hold your hand, and he moves fast.
While PDFs are circulating in academic repositories and university libraries (via Springer/Cambridge Core access), be careful. The official PDF from Cambridge is high quality, but many scanned copies online have garbled figures—specifically the pointer diagrams, which are crucial for understanding the "Dancing Links" algorithm in Chapter 5. advanced data structures peter brass pdf
You are implementing a database index, a file system, or a memory allocator. You want to know the lower bounds of a problem, not just the solution. You need to learn graph traversal (Dijkstra/BFS) or