= About

Design rationale, mathematical background, the named-parameter protocol
used by the older algorithms, the full bibliography, and the
non-technical side of the project (history, credits, publications,
users).

[cols="1,3"]
|===
| Page | What it covers

| xref:about/design.adoc[Design Rationale]
| Why the library looks the way it does: generic programming, separation
  of graph structure from algorithm, property maps, visitors.

| xref:about/graph_theory_review.adoc[Graph Theory Review]
| A short refresher on vertices, edges, paths, cycles, trees,
  connectivity, planarity, and the algorithm families that operate on
  them. Read this first if graph theory is new to you.

| xref:about/bgl_named_params.adoc[Named Parameters]
| How the `bgl_named_params<...>` mechanism works. Relevant to any
  algorithm whose modern overloads accept a `params` block
  (`weight_map(...)`, `predecessor_map(...)`, ...).

| xref:about/bibliography.adoc[Bibliography]
| Every academic reference cited from an algorithm page resolves here.

| xref:about/history.adoc[History]
| How the library evolved from its pre-1.0 roots at Indiana University
  through Boost releases.

| xref:about/acknowledgements.adoc[Acknowledgements]
| Credits for the core authors, contributors, and funders.

| xref:about/publications.adoc[Publications]
| Academic papers about BGL itself and its design.

| xref:about/users.adoc[BGL Users]
| Real-world projects and research groups that use Boost.Graph.
|===
