This is a library plus a test harness for collecting algorithms that use the GraphBLAS. For test coverage reports, see https://graphblas.org/LAGraph/ . Documentation: https://lagraph.readthedocs.org
The PageRank algorithms in LAGraph use a tolerance parameter which uses an absolute value (according to the comment, typically selected to be 10e-4) to terminate the execution early. The PageRank algorithm in Graphalytics (PageRankGX) does not have such a stopping condition – algorithms must run a fixed number of iterations. Therefore, calculating the rdiff is not necessary.
(Note: Graphalytics uses a relative tolerance of 0.01% for comparing results against the reference output, but this should not be taken into consideration during the execution of the algorithm.)
The PageRank algorithms in LAGraph use a tolerance parameter which uses an absolute value (according to the comment, typically selected to be 10e-4) to terminate the execution early. The PageRank algorithm in Graphalytics (
PageRankGX) does not have such a stopping condition – algorithms must run a fixed number of iterations. Therefore, calculating therdiffis not necessary.(Note: Graphalytics uses a relative tolerance of 0.01% for comparing results against the reference output, but this should not be taken into consideration during the execution of the algorithm.)