Opened 13 years ago
Closed 13 years ago
#3266 closed Bugs (fixed)
AdjacencyGraph issues
| Reported by: | anonymous | Owned by: | Andrew Sutton |
|---|---|---|---|
| Milestone: | Boost 1.41.0 | Component: | graph |
| Version: | Boost 1.39.0 | Severity: | Cosmetic |
| Keywords: | Cc: |
Description
1) Kolmogorov_max_flow requires the input graph to model the AdjacencyGraph concept. This is not documented. 2) adjacency_list models AdjacencyGraph, but this is not documented. 3) The AdjacencyGraph concept does not appear among the various Graph concepts in the online ToC .
Change History (3)
comment:1 by , 13 years ago
comment:2 by , 13 years ago
| Milestone: | Boost 1.40.0 → Boost 1.41.0 |
|---|---|
| Severity: | Problem → Cosmetic |
1 & 2) The edge() function is actually defined for every graph and adaptor, meaning that it should rightfully be defined in Graph. AdjacencyMatrix should then just refine the edge() operation, requiring it to run in O(1) time. No solution yet.
3) This issue is was reported in #3191.
comment:3 by , 13 years ago
| Resolution: | → fixed |
|---|---|
| Status: | new → closed |
(In [57928]) Added lookup_edge() function as wrapper for graphs that do not model AdjacencyMatrix; changed functions to use it instead of edge(); added is_adjacency_matrix traits class; updated docs to reflect Adjacency Matrix requirements and suggestions; fixes #3266
Argh... I meant AdjacencyMatrix!