Object

ml.sparkling.graph.operators.algorithms.shortestpaths

ShortestPathsAlgorithm

Related Doc: package shortestpaths

Permalink

object ShortestPathsAlgorithm extends Product with Serializable

Main object of shortest paths algorithm Created by Roman Bartusiak (roman.bartusiak@pwr.edu.pl http://riomus.github.io).

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ShortestPathsAlgorithm
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. 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 computeAPSPToDirectory[VD, ED](graph: Graph[VD, ED], outDirectory: String, treatAsUndirected: Boolean, bucketSize: Long)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Unit

    Permalink

  7. def computeAllPathsUsing[VD, ED, PT](graph: Graph[VD, ED], vertexPredicate: VertexPredicate[VD], treatAsUndirected: Boolean, pathProcessor: PathProcessor[VD, ED, PT])(implicit arg0: ClassTag[ED], arg1: ClassTag[PT], num: Numeric[ED]): Graph[PT, ED]

    Permalink

    Path computing main method, should be used for further development and extension, object contains methods for main computations please use them instead of configuring this one

    Path computing main method, should be used for further development and extension, object contains methods for main computations please use them instead of configuring this one

    VD

    - vertex type

    ED

    - edge type

    PT

    - path type

    graph

    - graph for computation

    treatAsUndirected

    - treat graph as undirected (each path will be bidirectional)

    pathProcessor

    - path processor that will handle path type dependent operations (processor for double, set etc.)

    num

    - numeric to operate on edge lengths

    returns

    - Graph where each vertex contains all its shortest paths, type depends on path processor (double, list etc.)

  8. def computeShortestPaths[VD, ED](graph: Graph[VD, ED], vertexPredicate: VertexPredicate[VD] = AllPathPredicate, treatAsUndirected: Boolean = false)(implicit arg0: ClassTag[ED], num: Numeric[ED]): Graph[WithPathContainer, ED]

    Permalink

    Computes shoretest all pair shortest paths with paths (each vertex will has map of its paths to orher vertiecs, map values are sets of paths (lists) where first element(0) is path length)

    Computes shoretest all pair shortest paths with paths (each vertex will has map of its paths to orher vertiecs, map values are sets of paths (lists) where first element(0) is path length)

    VD

    - vertex data type

    ED

    - edge data type (must be numeric)

    vertexPredicate

    - if true for vertexId, then distance to vertex is computed ,by default distances to all vertices are computed

    treatAsUndirected

    - by default false, if true each edge is treated as bidirectional

    num

    - numeric parameter for ED

    returns

    graph where each vertex has map of its shortest paths

  9. def computeShortestPathsLengths[VD, ED](graph: Graph[VD, ED], vertexPredicate: VertexPredicate[VD] = AllPathPredicate, treatAsUndirected: Boolean = false)(implicit arg0: ClassTag[ED], num: Numeric[ED]): Graph[DataMap, ED]

    Permalink

    Compute all pair shortest paths lengths (each vertex will contains map of shortest paths to other vertices)

    Compute all pair shortest paths lengths (each vertex will contains map of shortest paths to other vertices)

    VD

    - vertex data type

    ED

    - edge data type (must be numeric)

    vertexPredicate

    - if true for vertexId, then distance to vertex is computed ,by default distances to all vertices are computed

    treatAsUndirected

    - by default false, if true each edge is treated as bidirectional

    num

    - numeric parameter for ED

    returns

    graph where each vertex has map of its shortest paths lengths

  10. def computeShortestPathsLengthsIterative[VD, ED](graph: Graph[VD, ED], bucketSizeProvider: BucketSizeProvider[VD, ED], treatAsUndirected: Boolean = false, checkpointingFrequency: Int = 20)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Graph[DataMap, ED]

    Permalink

    Compute all pair shortest paths lengths (each vertex will contains map of shortest paths to other vertices) in multiple super-steps of size provided by @bucketSizeProvider

    Compute all pair shortest paths lengths (each vertex will contains map of shortest paths to other vertices) in multiple super-steps of size provided by @bucketSizeProvider

    VD

    - vertex data type

    ED

    - edge data type (must be numeric)

    bucketSizeProvider

    - method that provides single super-step size

    treatAsUndirected

    - by default false, if true each edge is treated as bidirectional

    num

    - numeric parameter for ED

    returns

    graph where each vertex has map of its shortest paths

  11. def computeSingleShortestPathsLengths[VD, ED](graph: Graph[VD, ED], vertexId: VertexId, treatAsUndirected: Boolean = false)(implicit arg0: ClassTag[ED], num: Numeric[ED]): Graph[Double, ED]

    Permalink

    Compute shortest paths lengths from all vertices to single one (each vertex will contain distance to given vertex)

    Compute shortest paths lengths from all vertices to single one (each vertex will contain distance to given vertex)

    VD

    - vertex data type

    ED

    - edge data type (must be numeric)

    vertexId

    - vertex id to witch distances will be computed

    treatAsUndirected

    - by default false, if true each edge is treated as bidirectional

    num

    - numeric parameter for ED

    returns

    graph where each vertex has distance to @vertexId

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

    Permalink
    Definition Classes
    AnyRef

  13. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  14. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  16. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  17. val logger: Logger

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  22. final def wait(): Unit

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

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

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

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped