Object

ml.sparkling.graph.operators.measures.edge

AdamicAdar

Related Doc: package edge

Permalink

object AdamicAdar extends EdgeMeasure[Double, NeighboursMap]

Created by Roman Bartusiak (roman.bartusiak@pwr.edu.pl http://riomus.github.io).

Linear Supertypes
EdgeMeasure[Double, NeighboursMap], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. AdamicAdar
  2. EdgeMeasure
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def compute[E](graph: Graph[NeighboursMap, E], treatAsUndirected: Boolean = false)(implicit arg0: ClassTag[E], ot: ClassTag[Double]): Graph[NeighboursMap, Double]

    Permalink

    Computes measure for give graph that has values expected by measure

    Computes measure for give graph that has values expected by measure

    Definition Classes
    EdgeMeasure
  7. def computeValue(srcAttr: NeighboursMap, dstAttr: NeighboursMap, treatAsUndirected: Boolean = false): Double

    Permalink

    Computes measure for pair of vertices attriubtes

    Computes measure for pair of vertices attriubtes

    Definition Classes
    AdamicAdarEdgeMeasure
  8. def computeWithPreprocessing[VD, E](graph: Graph[VD, E], treatAsUndirected: Boolean = false)(implicit arg0: ClassTag[VD], arg1: ClassTag[E], ot: ClassTag[Double]): Graph[NeighboursMap, Double]

    Permalink

    Prepares graph for measure computation and do computation

    Prepares graph for measure computation and do computation

    Definition Classes
    EdgeMeasure
  9. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  15. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  18. def preprocess[VD, E](graph: Graph[VD, E], treatAsUndirected: Boolean = false)(implicit arg0: ClassTag[VD], arg1: ClassTag[E]): Graph[NeighboursMap, E]

    Permalink

    Prepares graph for measure computation

    Prepares graph for measure computation

    Definition Classes
    AdamicAdarEdgeMeasure
  19. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  20. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  21. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from EdgeMeasure[Double, NeighboursMap]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped