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

Traits for the sequential graph with map storage.The adjacency list is used by default, with map storage for vertices and vector storage for their adjacent edges, and integral vertex descriptors. More...

Public Types
typedef VertexP	vertex_property
typedef EdgeP	edge_property
typedef size_t	vertex_descriptor
typedef size_t	simple_vertex_descriptor
typedef edge_descriptor_impl< vertex_descriptor >	edge_descriptor
typedef vdg_map_int< 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_map_int< D, M, VertexP, EdgeP >

Traits for the sequential graph with map storage.

The adjacency list is used by default, with map storage for vertices and vector storage for their adjacent edges, and integral vertex descriptors.

---

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

• graph_traits.h