Needed to compute max flow in a project and found the official document of BGL to be rather obscure, hence record some materials which I think can help to understand this library a little better:
This is the official book of boost. The explanation is clear and elaborate. Very good introduction, but the version of boost seems a little bit old and it does not cover flow computing:
https://theboostcpplibraries.com/boost.graph-vertices-and-edges
This IBM tutorial can serve as a supplement of the above official introduction:
https://www.ibm.com/developerworks/aix/library/au-aix-boost-graph/
Other than the examples in boost documents, I found this piece of codes especially helpful for building a flow network:
https://www.boost.org/doc/libs/1_69_0/boost/graph/read_dimacs.hpp
This seems to be just the compilation of all examples in boost documents, a little helpful anyway：
https://www.technical-recipes.com/2015/getting-started-with-the-boost-graph-library/
The following should be an in-depth explanation of the libary, however, I haven't read any:
https://markqiu.files.wordpress.com/2009/12/boost-graph-library.pdf
Of course, the boost document should serve as another in-depth explanation :-)