VeloGraphX
High-performance dynamic graph analytics in C++20
Loading...
Searching...
No Matches
velographx::BasicIncrementalPageRank< Graph > Class Template Reference

#include <pagerank.hpp>

Public Member Functions

 BasicIncrementalPageRank (Graph &g, double damping=0.85)
 
const std::vector< double > & values () const noexcept
 
std::size_t last_repaired_vertices () const noexcept
 
std::size_t last_repair_iterations () const noexcept
 
double last_residual_l1 () const noexcept
 
double last_residual_linf () const noexcept
 
bool last_full_recompute_converged () const noexcept
 
void apply (const UpdateBatch &batch, std::size_t local_iterations=24, double tol=1e-9, double full_fallback_fraction=0.60)
 
void recompute (std::size_t max_iterations=200, double tol=1e-12)
 
PageRankValidation validate_against_full (std::size_t reference_max_iterations=500, double reference_tol=1e-12, double l1_tolerance=1e-6, double linf_tolerance=1e-7) const
 
PageRankValidation apply_validated (const UpdateBatch &batch, std::size_t local_iterations=64, double local_tol=1e-10, double full_fallback_fraction=0.95, std::size_t reference_max_iterations=500, double reference_tol=1e-12, double l1_tolerance=1e-6, double linf_tolerance=1e-7)
 

Detailed Description

template<class Graph>
class velographx::BasicIncrementalPageRank< Graph >

Definition at line 30 of file pagerank.hpp.

Constructor & Destructor Documentation

◆ BasicIncrementalPageRank()

template<class Graph >
velographx::BasicIncrementalPageRank< Graph >::BasicIncrementalPageRank ( Graph &  g,
double  damping = 0.85 
)
inlineexplicit

Member Function Documentation

◆ apply()

◆ apply_validated()

template<class Graph >
PageRankValidation velographx::BasicIncrementalPageRank< Graph >::apply_validated ( const UpdateBatch batch,
std::size_t  local_iterations = 64,
double  local_tol = 1e-10,
double  full_fallback_fraction = 0.95,
std::size_t  reference_max_iterations = 500,
double  reference_tol = 1e-12,
double  l1_tolerance = 1e-6,
double  linf_tolerance = 1e-7 
)
inline

◆ last_full_recompute_converged()

template<class Graph >
bool velographx::BasicIncrementalPageRank< Graph >::last_full_recompute_converged ( ) const
inlinenoexcept

Definition at line 45 of file pagerank.hpp.

◆ last_repair_iterations()

template<class Graph >
std::size_t velographx::BasicIncrementalPageRank< Graph >::last_repair_iterations ( ) const
inlinenoexcept

Definition at line 42 of file pagerank.hpp.

◆ last_repaired_vertices()

template<class Graph >
std::size_t velographx::BasicIncrementalPageRank< Graph >::last_repaired_vertices ( ) const
inlinenoexcept

Definition at line 41 of file pagerank.hpp.

◆ last_residual_l1()

template<class Graph >
double velographx::BasicIncrementalPageRank< Graph >::last_residual_l1 ( ) const
inlinenoexcept

Definition at line 43 of file pagerank.hpp.

◆ last_residual_linf()

template<class Graph >
double velographx::BasicIncrementalPageRank< Graph >::last_residual_linf ( ) const
inlinenoexcept

Definition at line 44 of file pagerank.hpp.

◆ recompute()

template<class Graph >
void velographx::BasicIncrementalPageRank< Graph >::recompute ( std::size_t  max_iterations = 200,
double  tol = 1e-12 
)
inline

◆ validate_against_full()

◆ values()

template<class Graph >
const std::vector< double > & velographx::BasicIncrementalPageRank< Graph >::values ( ) const
inlinenoexcept

Definition at line 40 of file pagerank.hpp.


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