Boost Graph Basics: Hands-On Workshop

Description:

Dive into the world of graph algorithms in C++ with the Boost Graph Library (BGL).

19:00 – Welcome
19:15 – Presentation: Boost Graph Library Basics
Defining graphs, adding vertices and edges, traversals with BFS and DFS, shortest paths with Dijkstra... The goal is to understand the key concepts and the generic, high-performance philosophy behind the BGL.
20:00 – Interactive Session: Your Projects and Use Cases
Open discussion about the graph algorithms and methods participants actually use. Share experiences, explore practical solutions in C++, and get collective feedback. This is the time to ask questions, present ideas, and experiment with simple examples. Lightning Talks welcome, just ask!
21:00 – Closing
Wrap-up and next steps for continuing your exploration of graphs in C++.

Who Should Attend:
C++ developers, software engineers, and anyone working with or interested in graph algorithms and high-performance graph libraries. Bring your questions, ideas, and curiosity!

Requirement: Laptop

---
Arnaud Becheler, PhD

Arnaud Becheler is a computational biologist and senior C++ engineer working with the C++ Alliance to modernize Boost.Graph with scalable community detection algorithms like Louvain, Leiden, and SBM. Arnaud is also a trainer for Human Coders, actively contributes to the C++ open-source community, and organizes workshops connecting developers and scientific users.