accessor_t typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
add_bidirectional_edge(edge_descriptor const &ed, edge_property const &p) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
add_edge(edge_descriptor const &edd, edge_property const &ep) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
add_edge(vertex_descriptor const &source, vertex_descriptor const &target, edge_property const &ep) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
add_edge(edge_descriptor const &edd, edge_property const &ep, bool bidir) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
add_edge_async(edge_descriptor const &edd, edge_property const &ep) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
add_edge_async(vertex_descriptor const &source, vertex_descriptor const &target, edge_property const &ep) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
add_element(vertex_type const &v) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
add_vertex(vertex_property const &v) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
add_vertex(vertex_descriptor const &gid, vertex_property const &v) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
adj_edge_iterator typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
aggregate_vp_apply(FCont const &fcont) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
apply(vertex_descriptor const &gid, F const &f, Distribution *distribution) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
apply_get(vertex_descriptor const &gid, F const &f) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
apply_get(vertex_descriptor const &gid, F const &f) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
apply_set(vertex_descriptor const &gid, F const &f) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
bc_base(void) (defined in stapl::bc_base) | stapl::bc_base | |
begin(void) (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
cid(void) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
cid_type typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
clear(void) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
clear_edges(void) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
const_accessor_t typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
const_adj_edge_iterator typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
const_iterator typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
const_reference typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
const_vertex_iterator typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
const_vertex_reference typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
container(void) (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
container_type typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
data() (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
defer(bool defer) (defined in stapl::bc_base) | stapl::bc_base | |
delete_edge(edge_descriptor const &ed) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
delete_vertex(vertex_descriptor gid) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
directness_type typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
domain(void) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
domain_type typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
edge_descriptor typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
edge_iterator typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
edge_property typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
edge_type typedef | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
edgelist_type typedef | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
edges_begin(void) (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
edges_end(void) (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
empty(void) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
end(void) (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
ep_apply(edge_descriptor const &ed, F const &f) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
ep_apply_get(edge_descriptor const &ed, F const &f) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
ep_find_apply(edge_descriptor const &ed, F const &f) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
erase_edges_if(Pred &&pred) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
find(vertex_descriptor const &gid) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
find_edge(edge_descriptor const &ed, vertex_iterator lit, adj_edge_iterator ei) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
find_vertex(vertex_descriptor const &gid) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
find_vertex(vertex_descriptor const &gid) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
get_cid(void) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
get_element(gid_type const &gid) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
get_element(gid_type const &gid) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
get_stored_element(gid_type const &gid) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
gid_type typedef | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
graph_base_container_base(Domain const &domain, cid_type const &cid) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
graph_base_container_base(Domain const &domain, cid_type const &cid, value_type const &default_value) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
has_edge(vertex_descriptor const &source, vertex_descriptor const &target) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
index_of(iterator iter) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
insert_edge(edge_descriptor const &edd, edge_property const &ep, Comp const &comp) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
insert_edge(vertex_descriptor const &source, vertex_descriptor const &target, edge_property const &ep, Comp const &comp) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
insert_edge_async(edge_descriptor const &edd, edge_property const &ep, Comp const &comp) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
insert_edge_async(vertex_descriptor const &source, vertex_descriptor const &target, edge_property const &ep, Comp const &comp) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
iterator typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
local_position(gid_type const &gid) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
m_cid | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | protected |
m_data | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | protected |
m_defer_cleanup (defined in stapl::bc_base) | stapl::bc_base | protected |
m_domain | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | protected |
make_iterator(vertex_descriptor const &gid) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
make_reference(vertex_descriptor const &gid) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
make_reference(vertex_descriptor const &gid) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
multiplicity_type typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
next_free_descriptor() (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
num_edges(void) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
num_self_edges(void) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
num_vertices(void) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
operator[](gid_type const &g) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
operator[](gid_type const &g) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
reference typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
remove_duplicate_edges() | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
reserve_adjacency(vertex_descriptor const &gid, size_t num_adjacents) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
set_cid(cid_type cid) (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
simple_vertex_descriptor typedef | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
size(void) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
sort_edges(Comp const &comp) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
suspend_vertex(vertex_descriptor gid) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
update_next_descriptor(vertex_descriptor const &vd) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
value_type typedef | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
vertex_descriptor typedef | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
vertex_iterator typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
vertex_property typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
vertex_reference typedef (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
vertex_type typedef | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
vp_apply(vertex_descriptor const &gid, F const &f) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
vp_apply(vertex_descriptor const &gid, F const &f) const | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
vp_apply_async(vertex_descriptor const &gid, F const &f) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
vp_set(vertex_descriptor const &gid, typename Traits::stored_type const &vp) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |
~bc_base(void)=default (defined in stapl::bc_base) | stapl::bc_base | virtual |
~graph_base_container_base(void) (defined in stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits >) | stapl::graph_base_container_base< D, M, VertexP, EdgeP, Traits > | |