Documentation of 'edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker' Java class
RelativeAuthorityRanker
edu.uci.ics.jung.algorithms.importance

Class RelativeAuthorityRanker<V,E>

  • All Implemented Interfaces:
    IterativeContext
    Direct Known Subclasses:
    KStepMarkov


    public abstract class RelativeAuthorityRanker<V,E>
    extends AbstractRanker<V,E>
    This class provides basic infrastructure for relative authority algorithms that compute the importance of nodes relative to one or more root nodes. The services provided are:
    • The set of root nodes (priors) is stored and maintained
    • Getters and setters for the prior rank score are provided
    • Constructor Detail

      • RelativeAuthorityRanker

        public RelativeAuthorityRanker()
    • Method Detail

      • setPriorRankScore

        public void setPriorRankScore(V v,
                                      double value)
        Allows the user to specify a value to set for the prior rank score
        Parameters:
        v - the root node (prior)
        value - the score to set to

DataMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.