stapl::seq_graph_traits< D, M, VertexP, EdgeP > Struct Template Reference

Traits class for adjacency_list_model based on dynamic storage. More...

Public Types
typedef define_value_type< VertexP >::type	stored_type
typedef stored_type	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 select_graph_edge< vertex_descriptor, edge_property, D >::type	edge_type
typedef adjacency_list_impl< edge_type >	edgelist_type
typedef vertex_adj_list_impl< vertex_descriptor, vertex_property, edgelist_type >	vertex_impl_type
typedef adjacency_list_hashmap_storage< seq_graph_traits >	storage_type
typedef sequential::graph_type< seq_graph_traits, D >::type	directness_type
typedef sequential::graph_type< seq_graph_traits, M >::type	multiplicity_type

Detailed Description

template<graph_attributes D, graph_attributes M, typename VertexP, typename EdgeP>
struct stapl::seq_graph_traits< D, M, VertexP, EdgeP >

Traits class for adjacency_list_model based on dynamic storage.

Template Parameters

D	graph-attribute specifying Directedness (DIRECTED/UNDIRECTED).
M	graph-attribute specifying Multiedge. (MULTIEDGES/NONMULTIEDGES).
VertexP	type of property for the vertex. Must be default assignable, copyable and assignable.
EdgeP	type of property for the edge. Must be default assignable, copyable and assignable.

Uses adjacency_list_hashmap_storage for vertices.

---

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

• dynamic_base_container.hpp