Class

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

WithPathProcessor

Related Doc: package pathprocessors

Permalink

class WithPathProcessor[VD, ED] extends PathProcessor[VD, ED, Map[VertexId, (ED, Set[List[VertexId]])]]

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

Linear Supertypes
PathProcessor[VD, ED, Map[VertexId, (ED, Set[List[VertexId]])]], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. WithPathProcessor
  2. PathProcessor
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new WithPathProcessor()

    Permalink

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

    Permalink
    Definition Classes
    WithPathProcessor → PathProcessor

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  9. def extendPathsMerging(targetVertexId: VertexId, map: PathsMap, vertexId: VertexId, distance: ED, map2: PathsMap)(implicit num: Numeric[ED]): PathsMap

    Permalink
    Definition Classes
    WithPathProcessor → PathProcessor

  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  11. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  12. def getNewContainerForPaths(): Map[VertexId, PathsSet]

    Permalink
    Definition Classes
    WithPathProcessor → PathProcessor

  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  15. def mergeMessages(map1: Map[VertexId, (ED, Set[List[VertexId]])], map2: Map[VertexId, (ED, Set[List[VertexId]])])(implicit num: Numeric[ED]): Map[VertexId, (ED, Set[List[VertexId]])]

    Permalink
    Definition Classes
    PathProcessor

  16. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  17. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  19. def processNewMessages(map1: PathsMap, map2: PathsMap)(implicit num: Numeric[ED]): PathsMap

    Permalink
    Definition Classes
    WithPathProcessor → PathProcessor

  20. def putNewPath(map: PathsMap, to: VertexId, weight: ED)(implicit num: Numeric[ED]): PathsMap

    Permalink
    Definition Classes
    WithPathProcessor → PathProcessor

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

    Permalink
    Definition Classes
    AnyRef

  22. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  23. final def wait(): Unit

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

  24. final def wait(arg0: Long, arg1: Int): Unit

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

  25. final def wait(arg0: Long): Unit

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

Inherited from PathProcessor[VD, ED, Map[VertexId, (ED, Set[List[VertexId]])]]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped