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
    Author:
    Scott White
    • Field Detail

      • priorRankScoreMap

        protected java.util.Map<V,​java.lang.Number> priorRankScoreMap
        The default key used for the user datum key corresponding to prior rank scores.
    • Constructor Detail

      • RelativeAuthorityRanker

        public RelativeAuthorityRanker()
    • Method Detail

      • finalizeIterations

        protected void finalizeIterations()
        Cleans up all of the prior rank scores on finalize.
        Overrides:
        finalizeIterations in class AbstractRanker<V,​E>
      • getPriorRankScore

        protected double getPriorRankScore​(V v)
        Retrieves the value of the prior rank score.
        Parameters:
        v - the root node (prior)
        Returns:
        the prior rank score
      • 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
      • getPriors

        protected java.util.Set<V> getPriors()
        Retrieves the set of priors.
        Returns:
        the set of root nodes (priors)
      • setPriors

        protected void setPriors​(java.util.Set<V> priors)
        Specifies which vertices are root nodes (priors).
        Parameters:
        priors - the root nodes