velographx::BasicIncrementalBFS< Graph > Class Template Reference

#include <bfs.hpp>

Public Member Functions
	BasicIncrementalBFS (Graph &g, VertexId source, double deletion_fallback_fraction=0.35)
const std::vector< std::uint32_t > &	distances () const noexcept
std::size_t	reachable_count () const noexcept
std::size_t	last_deletion_candidates () const noexcept
std::size_t	last_affected_vertices () const noexcept
bool	last_used_full_recompute () const noexcept
void	apply (const UpdateBatch &batch)
void	recompute ()

Static Public Attributes
static constexpr std::uint32_t	unreachable = std::numeric_limits<std::uint32_t>::max()

Detailed Description

template<class Graph>
class velographx::BasicIncrementalBFS< Graph >

Definition at line 14 of file bfs.hpp.

Constructor & Destructor Documentation

BasicIncrementalBFS()

template<class Graph >

velographx::BasicIncrementalBFS< Graph >::BasicIncrementalBFS ( Graph &  g, VertexId  source, double  deletion_fallback_fraction = 0.35  )

inline

Definition at line 18 of file bfs.hpp.

References velographx::BasicIncrementalBFS< Graph >::recompute().

Member Function Documentation

apply()

template<class Graph >

void velographx::BasicIncrementalBFS< Graph >::apply ( const UpdateBatch &  batch )

inline

Definition at line 29 of file bfs.hpp.

References velographx::apply_updates(), velographx::UpdateBatch::empty(), velographx::has_edge(), velographx::is_directed(), velographx::BasicIncrementalBFS< Graph >::recompute(), velographx::BasicIncrementalBFS< Graph >::unreachable, velographx::UpdateBatch::updates, and velographx::vertex_count().

distances()

template<class Graph >

const std::vector< std::uint32_t > & velographx::BasicIncrementalBFS< Graph >::distances ( ) const

inlinenoexcept

Definition at line 23 of file bfs.hpp.

last_affected_vertices()

template<class Graph >

std::size_t velographx::BasicIncrementalBFS< Graph >::last_affected_vertices ( ) const

inlinenoexcept

Definition at line 26 of file bfs.hpp.

last_deletion_candidates()

template<class Graph >

std::size_t velographx::BasicIncrementalBFS< Graph >::last_deletion_candidates ( ) const

inlinenoexcept

Definition at line 25 of file bfs.hpp.

last_used_full_recompute()

template<class Graph >

bool velographx::BasicIncrementalBFS< Graph >::last_used_full_recompute ( ) const

inlinenoexcept

Definition at line 27 of file bfs.hpp.

reachable_count()

template<class Graph >

std::size_t velographx::BasicIncrementalBFS< Graph >::reachable_count ( ) const

inlinenoexcept

Definition at line 24 of file bfs.hpp.

recompute()

template<class Graph >

void velographx::BasicIncrementalBFS< Graph >::recompute ( )

inline

Definition at line 100 of file bfs.hpp.

References velographx::for_each_neighbor(), velographx::BasicIncrementalBFS< Graph >::unreachable, and velographx::vertex_count().

Referenced by velographx::BasicIncrementalBFS< Graph >::apply(), and velographx::BasicIncrementalBFS< Graph >::BasicIncrementalBFS().

Member Data Documentation

unreachable

template<class Graph >

constexpr std::uint32_t velographx::BasicIncrementalBFS< Graph >::unreachable = std::numeric_limits<std::uint32_t>::max()

staticconstexpr

Definition at line 16 of file bfs.hpp.

Referenced by velographx::BasicIncrementalBFS< Graph >::apply(), and velographx::BasicIncrementalBFS< Graph >::recompute().

---

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

• include/velographx/incremental/bfs.hpp