ml.sparkling.graph.operators.algorithms.aproximation

ApproximatedShortestPathsAlgorithm

object ApproximatedShortestPathsAlgorithm extends Product with Serializable

Created by Roman Bartusiak <[email protected]> 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
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

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

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

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  8. def clone(): AnyRef

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

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

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

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

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

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

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

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

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

  17. val defaultNewPath: (JDouble) ⇒ JDouble

  18. val defaultPathModifier: (VertexId, VertexId, JDouble) ⇒ JDouble

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

    Definition Classes
    AnyRef

  20. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  21. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  23. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  24. val logger: Logger

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

    Definition Classes
    AnyRef

  26. final def notify(): Unit

    Definition Classes
    AnyRef

  27. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  29. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped