Explore the development of a generic binary tree implementation for Boost.Graph in this conference talk from C++Now 2019. Delve into the challenges and design considerations of creating a mutable, bidirectional graph that competes with compressed_sparse_row_graph in performance. Examine the influence of Donald Knuth's "The Art of Computer Programming" and Alexander Stepanov & Paul McJones' "Elements of Programming" on binary tree algorithms and data structures. Investigate various class designs and storage options, weighing their trade-offs and performance impacts. Learn about graph concepts, mutability, interface implementation, and iterator ranges as they relate to binary trees. Engage in a discussion about future directions and potential pathways to a standard graph library in C++.
Overview
Syllabus
Intro
Outline
My goal
Linear and nonlinear structures
STL models
Multi parameterization
Questions
Coordinates
Graph concepts
Graph suffix
Mutability
Interface Implementation
Nodes
Vertex
Graph
Implementation
Iterator range
Taught by
CppNow