ml.sparkling.graph.operators.measures.utils

NeighboursUtils

object NeighboursUtils

Created by Roman Bartusiak ([email protected] http://riomus.github.io). Utitlity class that produces graphs where vertices are associated with maps of neighbours using it.unimi.dsi.fastutil as data store

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NeighboursUtils
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. type NeighbourSet = LongOpenHashSet

  2. type NeighboursMap = Long2ObjectOpenHashMap[NeighbourSet]

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. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  10. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  12. def getWithNeighbours[VD, ED](graph: Graph[VD, ED], treatAsUndirected: Boolean = false, vertexPredicate: (VertexId) ⇒ Boolean = AllPathPredicate)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): Graph[NeighbourSet, ED]

    Computes first level neighbours for each vertex

    Computes first level neighbours for each vertex

    VD
    ED
    graph
    treatAsUndirected
    vertexPredicate
    returns

    graph where vertex is associated with its first level neighbours

  13. def getWithSecondLevelNeighbours[VD, ED](graph: Graph[VD, ED], treatAsUndirected: Boolean = false, vertexPredicate: (VertexId) ⇒ Boolean = AllPathPredicate)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): Graph[NeighboursMap, ED]

    Computes second level neighbours for each vertex

    Computes second level neighbours for each vertex

    VD
    ED
    graph
    treatAsUndirected
    vertexPredicate
    returns

    returns map of first level neighbours to their neighbours

  14. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  15. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  17. final def notify(): Unit

    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  20. def toString(): String

    Definition Classes
    AnyRef → Any

  21. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped