STAPL API Reference          
Overview   Containers   Algorithms   Views   Skeletons   Run-Time System
Modules     Classes    
stapl::sequential::adjacency_list_graph< Traits > Member List

This is the complete list of members for stapl::sequential::adjacency_list_graph< Traits >, including all inherited members.

add_edge(const edge_descriptor &ed)stapl::sequential::adjacency_list_graph< Traits >
add_edge(const edge_descriptor &ed, const edge_property &p)stapl::sequential::adjacency_list_graph< Traits >
add_edge_pair(this_type &g, const edge_descriptor &edr, const edge_property &epy)stapl::sequential::adjacency_list_graph< Traits >friend
add_internal_edge(this_type &g, const edge_descriptor &ed, const edge_property &p)stapl::sequential::adjacency_list_graph< Traits >friend
add_vertex()stapl::sequential::adjacency_list_graph< Traits >
add_vertex(const vertex_property &vp)stapl::sequential::adjacency_list_graph< Traits >
add_vertex(vertex_descriptor vd, const vertex_property &vp)stapl::sequential::adjacency_list_graph< Traits >
adj_edge_iterator typedefstapl::sequential::adjacency_list_graph< Traits >
adjacency_list_graph(size_t size=0)stapl::sequential::adjacency_list_graph< Traits >
begin() (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >
begin() const (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >
clear(void)stapl::sequential::adjacency_list_graph< Traits >
const_adj_edge_iterator typedefstapl::sequential::adjacency_list_graph< Traits >
const_edge_iterator typedefstapl::sequential::adjacency_list_graph< Traits >
const_iterator typedef (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >
const_vertex_iterator typedef (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >
delete_all_edges_to_v(const vertex_descriptor &vd)stapl::sequential::adjacency_list_graph< Traits >
delete_edge(const edge_descriptor &ed)stapl::sequential::adjacency_list_graph< Traits >
delete_vertex(const vertex_descriptor &vd)stapl::sequential::adjacency_list_graph< Traits >
edge_descriptor typedef (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >
edge_iterator typedefstapl::sequential::adjacency_list_graph< Traits >
edge_property typedef (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >
edge_type typedef (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >protected
edgelist_type typedef (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >protected
edges_begin()stapl::sequential::adjacency_list_graph< Traits >
edges_begin() conststapl::sequential::adjacency_list_graph< Traits >
edges_end()stapl::sequential::adjacency_list_graph< Traits >
edges_end() conststapl::sequential::adjacency_list_graph< Traits >
end() (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >
end() const (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >
find_edge(const edge_descriptor &ed, vertex_iterator &vi, adj_edge_iterator &ei)stapl::sequential::adjacency_list_graph< Traits >
find_edge(const edge_descriptor &ed, const_vertex_iterator &vi, const_adj_edge_iterator &ei) conststapl::sequential::adjacency_list_graph< Traits >
find_vertex(vertex_descriptor const &vd) conststapl::sequential::adjacency_list_graph< Traits >
find_vertex(vertex_descriptor const &vd)stapl::sequential::adjacency_list_graph< Traits >
get_max_descriptor() conststapl::sequential::adjacency_list_graph< Traits >
get_num_edges() conststapl::sequential::adjacency_list_graph< Traits >
get_num_vertices() conststapl::sequential::adjacency_list_graph< Traits >
iterator typedef (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >
m_eidstapl::sequential::adjacency_list_graph< Traits >protected
m_nestapl::sequential::adjacency_list_graph< Traits >protected
m_verticesstapl::sequential::adjacency_list_graph< Traits >protected
set_edge(const vertex_descriptor &v, const size_t i, const vertex_descriptor &neighbor)stapl::sequential::adjacency_list_graph< Traits >
set_edge(const vertex_descriptor &v, const size_t i, const size_t max, const vertex_descriptor &neighbor)stapl::sequential::adjacency_list_graph< Traits >
simple_vertex_descriptor typedef (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >
update_descriptor(vertex_descriptor &vd, vertex_iterator &vi)stapl::sequential::adjacency_list_graph< Traits >
vertex_descriptor typedef (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >
vertex_impl_type typedef (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >protected
vertex_iterator typedef (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >
vertex_property typedef (defined in stapl::sequential::adjacency_list_graph< Traits >)stapl::sequential::adjacency_list_graph< Traits >
vertex_set_type typedefstapl::sequential::adjacency_list_graph< Traits >protected