view release on metacpan or  search on metacpan

README  view on Meta::CPAN

        This is (1 - how much people can move from one node to another
        unconnected one randomly). Decreasing this number makes convergence
        more likely, but brings us further from the true eigenvector.

    max_tries
        The maximum number of tries until we give up trying to achieve
        convergence.

    convergence
        The maximum number the difference between two subsequent vectors
        must be before we say we are "convergent enough". The convergence
        rate is the rate at which "alpha^t" goes to 0. Thus, if you set
        "alpha" to 0.85, and "convergence" to 0.000001, then you will need
        85 tries.

  add_arc
    Add an arc to the pagerank object before running the computation. The
    actual values don't matter. So you can run:

        $pr->add_arc("Apple", "Orange");

lib/Algorithm/PageRank/XS.pm  view on Meta::CPAN

This is (1 - how much people can move from one node to another unconnected one randomly). Decreasing
this number makes convergence more likely, but brings us further from the true eigenvector.

=item max_tries

The maximum number of tries until we give up trying to achieve convergence.

=item convergence

The maximum number the difference between two subsequent vectors must be before we say we are
"convergent enough". The convergence rate is the rate at which C<alpha^t> goes to 0. Thus,
if you set C<alpha> to C<0.85>, and C<convergence> to C<0.000001>, then you will need C<85> tries.

=back

=head2 add_arc

Add an arc to the pagerank object before running the computation.
The actual values don't matter. So you can run: