ml.sparkling.graph.operators.measures.edge

AdamicAdar

object AdamicAdar extends EdgeMeasure[Double, NeighboursMap]

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

Linear Supertypes
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
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

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

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. def clone(): AnyRef

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

    Computes measure for give graph that has values expected by measure

    Computes measure for give graph that has values expected by measure

    E
    graph
    treatAsUndirected
    ot
    returns

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

    Computes measure for pair of vertices attriubtes

    Computes measure for pair of vertices attriubtes

    srcAttr
    dstAttr
    treatAsUndirected
    returns

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

    Prepares graph for measure computation and do computation

    Prepares graph for measure computation and do computation

    VD
    E
    graph
    treatAsUndirected
    ot
    returns

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

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

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

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

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

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

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

    Definition Classes
    AnyRef
  18. final def notify(): Unit

    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit

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

    Prepares graph for measure computation

    Prepares graph for measure computation

    VD
    E
    graph
    treatAsUndirected
    returns

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

    Definition Classes
    AnyRef
  22. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from EdgeMeasure[Double, NeighboursMap]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped