Chapter 5. Shortest-Paths Problems
In this chapter we solve some Internet packet-routing problems using shortest-paths algorithms included in BGL. The first section explains the shortest-paths problem in general and reviews some definitions. The second section gives a brief introduction to packet routing. The third and fourth sections describe two commonly used packet-routing protocols and present their implementations using BGL.
5.1 Definitions
A path is a sequence of vertices 
v0,v1,...,vk
in a graph G = (V, E) such that each of the edges (v
Get The Boost Graph Library: User Guide and Reference Manual now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
