Why is edge_iterator not an integer_iterator like vertex_iterator? I am using undirected adjacency list with vectors to store both vertices and edges.
相关问题
- boost::process system leaking file descriptors
- Derived class offset calculation in boost::seriali
- Boost MPI doesn't free resources when listenin
- boost::multiprecision::uint128_t sizeof is 24
-
Specialize template for any vector
相关文章
- boost split with a single character or just one st
- boost serialization and register_type
- Forwarding a shared_ptr without class declaration
- init boost::optional of non-copyable object
- What is the equivalent of boost::make_transform_it
- C++ boost date_input_facet seems to parse dates un
- Trouble building Boost Libraries
- c++ Boost asio error: no shared cipher
Adjacency lists store a list of adjacencies.
That is, per vertex, it stores a list of adjacent vertices.
That means that vertices can be stored in a single container, but each vertex contains its own (separate) container of adjacencies ("other vertex references").
This should explain: there is no such thing as "the edge container", making it impossible to directly address the edges by index or as a single adjacent container.
Note there are other graph models (e.g. EdgeList concept, as modeled by edge_list)