YoVDO

A Generic Binary Tree - Why Grow Your Own?

Offered By: CppNow via YouTube

Tags

C++Now Courses Graph Theory Courses Algorithms Courses Software Engineering Courses Data Structures Courses Standard Template Library (STL) Courses Computational Geometry Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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++.

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

Related Courses

Aplicaciones de la teoría de grafos a la vida real
Miríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer