stapl::sequential::adj_graph_traits_vector_storage< D, M, VertexP, EdgeP > Class Template Reference

Traits for the sequential graph with "smart" vector storage.The adjacency list is used by default, with smart-vector storage for vertices and their adjacent edges, and smart vertex descriptors. A "smart" vector storage keeps versioning information for the graph, using which "smart" vertex descriptors can return iterators to their vertices in O(1) time. Smart vertex descriptors store iterators to their vertices inside, and return that iterator if the version matches the version of the graph. More...

Public Types
typedef VertexP	vertex_property
typedef EdgeP	edge_property
typedef size_t	simple_vertex_descriptor
typedef vertex_descriptor_vector< D, simple_vertex_descriptor, VertexP, EdgeP >	vertex_descriptor
typedef edge_descriptor_impl< vertex_descriptor >	edge_descriptor
typedef vdg_storage_vector< this_type >	storage_type
typedef select_edge< vertex_descriptor, edge_property, D >::type	edge_type
typedef adjacency_list_graph< this_type >	core_graph_type
typedef graph_type< this_type, D >::type	directness_type
typedef graph_type< this_type, M >::type	multiplicity_type

Detailed Description

template<graph_attributes D, graph_attributes M, class VertexP, class EdgeP>
class stapl::sequential::adj_graph_traits_vector_storage< D, M, VertexP, EdgeP >

Traits for the sequential graph with "smart" vector storage.

The adjacency list is used by default, with smart-vector storage for vertices and their adjacent edges, and smart vertex descriptors. A "smart" vector storage keeps versioning information for the graph, using which "smart" vertex descriptors can return iterators to their vertices in O(1) time. Smart vertex descriptors store iterators to their vertices inside, and return that iterator if the version matches the version of the graph.

---

The documentation for this class was generated from the following file:

• graph_traits.h