ml.sparkling.graph.operators.algorithms.shortestpaths.pathprocessors

WithDistanceProcessor

class WithDistanceProcessor[VD, ED] extends PathProcessor[VD, ED, Map[VertexId, ED]]

Created by Roman Bartusiak (roman.bartusiak@pwr.edu.pl http://riomus.github.io). Path processors that computes shortest paths lengths using standard scala collections

Linear Supertypes
PathProcessor[VD, ED, Map[VertexId, ED]], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. WithDistanceProcessor
  2. PathProcessor
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new WithDistanceProcessor()

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. def EMPTY_CONTAINER: Map[VertexId, ED]

    Definition Classes
    WithDistanceProcessorPathProcessor
  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  11. def extendPathsMerging(targetVertexId: VertexId, map: Map[VertexId, ED], vertexId: VertexId, distance: ED, map2: Map[VertexId, ED])(implicit num: Numeric[ED]): Map[VertexId, ED]

    Definition Classes
    WithDistanceProcessorPathProcessor
  12. def finalize(): Unit

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

    Definition Classes
    AnyRef → Any
  14. def getNewContainerForPaths(): Map[VertexId, ED]

    Definition Classes
    WithDistanceProcessorPathProcessor
  15. def hashCode(): Int

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

    Definition Classes
    Any
  17. def mergeMessages(map1: Map[VertexId, ED], map2: Map[VertexId, ED])(implicit num: Numeric[ED]): Map[VertexId, ED]

    Definition Classes
    PathProcessor
  18. final def ne(arg0: AnyRef): Boolean

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

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

    Definition Classes
    AnyRef
  21. def processNewMessages(map1: Map[VertexId, ED], map2: Map[VertexId, ED])(implicit num: Numeric[ED]): Map[VertexId, ED]

    Definition Classes
    WithDistanceProcessorPathProcessor
  22. def putNewPath(map: Map[VertexId, ED], to: VertexId, weight: ED)(implicit num: Numeric[ED]): Map[VertexId, ED]

    Definition Classes
    WithDistanceProcessorPathProcessor
  23. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  24. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from PathProcessor[VD, ED, Map[VertexId, ED]]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped