VeloGraphX
High-performance dynamic graph analytics in C++20
Loading...
Searching...
No Matches
velographx::DynamicGraph Member List

This is the complete list of members for velographx::DynamicGraph, including all inherited members.

add_edge(VertexId u, VertexId v)velographx::DynamicGraphinline
apply(const UpdateBatch &batch)velographx::DynamicGraphinline
base_edge_count_directed() const noexceptvelographx::DynamicGraphinline
bulk_load_edges(const std::vector< std::pair< VertexId, VertexId > > &edges)velographx::DynamicGraphinline
compact()velographx::DynamicGraphinline
compact_in_neighbors(VertexId v) const noexceptvelographx::DynamicGraphinline
compact_neighbors(VertexId u) const noexceptvelographx::DynamicGraphinline
delta_edge_count() const noexceptvelographx::DynamicGraphinline
delta_ratio() const noexceptvelographx::DynamicGraphinline
directed() const noexceptvelographx::DynamicGraphinline
dirty_in_segment_count() constvelographx::DynamicGraphinline
dirty_out_segment_count() constvelographx::DynamicGraphinline
DynamicGraph(std::size_t vertices=0, bool directed=false)velographx::DynamicGraphinlineexplicit
edge_count_directed() const noexceptvelographx::DynamicGraphinline
ensure_vertex(VertexId v)velographx::DynamicGraphinline
for_each_in_neighbor(VertexId v, Fn &&fn) constvelographx::DynamicGraphinline
for_each_neighbor(VertexId u, Fn &&fn) constvelographx::DynamicGraphinline
has_edge(VertexId u, VertexId v) constvelographx::DynamicGraphinline
in_neighbors(VertexId v) constvelographx::DynamicGraphinline
is_compact() const noexceptvelographx::DynamicGraphinline
maybe_compact(double threshold=0.25)velographx::DynamicGraphinline
neighbors(VertexId u) constvelographx::DynamicGraphinline
remove_edge(VertexId u, VertexId v)velographx::DynamicGraphinline
storage_bytes() const noexceptvelographx::DynamicGraphinline
version() const noexceptvelographx::DynamicGraphinline
vertex_count() const noexceptvelographx::DynamicGraphinline