Object

ml.sparkling.graph.operators.algorithms.aproximation

ApproximatedShortestPathsAlgorithm

Related Doc: package aproximation

Permalink

object ApproximatedShortestPathsAlgorithm extends Product with Serializable

Created by Roman Bartusiak <riomus@gmail.com> on 07.02.17.

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ApproximatedShortestPathsAlgorithm
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Type Members

  1. type PathModifier = (VertexId, VertexId, JDouble) ⇒ JDouble

    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 aproximatePaths[ED, VD](graph: Graph[VD, ED], coarsedGraph: Graph[Component, ED], coarsedShortestPaths: Graph[DataMap, ED], modifier: PathModifier = defaultPathModifier, vertexPredicate: SimpleVertexPredicate = AllPathPredicate, treatAsUndirected: Boolean)(implicit arg0: ClassTag[ED], arg1: ClassTag[VD], num: Numeric[ED]): Graph[Iterable[(VertexId, JDouble)], ED]

    Permalink

  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. 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

  8. def computeShortestPaths[VD, ED](graph: Graph[VD, ED], vertexPredicate: SimpleVertexPredicate = AllPathPredicate, treatAsUndirected: Boolean = true, modifier: PathModifier = defaultPathModifier)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Graph[Iterable[(VertexId, JDouble)], ED]

    Permalink

  9. def computeShortestPathsForDirectoryComputationUsing[VD, ED](graph: Graph[VD, ED], coarsedGraph: Graph[Component, ED], vertexPredicate: SimpleVertexPredicate = AllPathPredicate, treatAsUndirected: Boolean = true, modifier: PathModifier = defaultPathModifier)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Graph[Iterable[(VertexId, JDouble)], ED]

    Permalink

  10. def computeShortestPathsLengthsIterative[VD, ED](graph: Graph[VD, ED], bucketSizeProvider: BucketSizeProvider[Component, ED], treatAsUndirected: Boolean = true, modifier: PathModifier = defaultPathModifier)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Graph[Iterable[(VertexId, JDouble)], ED]

    Permalink

  11. def computeShortestPathsLengthsIterativeUsing[VD, ED](graph: Graph[VD, ED], coarsedGraph: Graph[Component, ED], bucketSizeProvider: BucketSizeProvider[Component, ED], treatAsUndirected: Boolean = true, modifier: PathModifier = defaultPathModifier)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Graph[Iterable[(VertexId, JDouble)], ED]

    Permalink

  12. def computeShortestPathsLengthsUsing[VD, ED](graph: Graph[VD, ED], vertexPredicate: SimpleVertexPredicate = AllPathPredicate, treatAsUndirected: Boolean = true, modifier: PathModifier = defaultPathModifier)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Graph[Iterable[(VertexId, JDouble)], ED]

    Permalink

  13. def computeShortestPathsLengthsWithoutCoarsingUsing[VD, ED](graph: Graph[VD, ED], coarsedGraph: Graph[Component, ED], vertexPredicate: SimpleVertexPredicate = AllPathPredicate, treatAsUndirected: Boolean = true, modifier: PathModifier = defaultPathModifier)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Graph[Iterable[(VertexId, JDouble)], ED]

    Permalink

  14. def computeSingleShortestPathsLengths[VD, ED](graph: Graph[VD, ED], vertexId: VertexId, treatAsUndirected: Boolean = true, modifier: PathModifier = defaultPathModifier)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], num: Numeric[ED]): Graph[Iterable[(VertexId, JDouble)], ED]

    Permalink

  15. val defaultNewPath: (JDouble) ⇒ JDouble

    Permalink

  16. val defaultPathModifier: PathModifier

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  18. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  19. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  21. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  22. val logger: Logger

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  24. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  25. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  27. final def wait(): Unit

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

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

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

  29. 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