Object

ml.sparkling.graph.operators.measures.utils

NeighboursUtils

Related Doc: package utils

Permalink

object NeighboursUtils

Created by Roman Bartusiak (roman.bartusiak@pwr.edu.pl 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
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NeighboursUtils
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Type Members

  1. type NeighbourSet = LongOpenHashSet

    Permalink
  2. type NeighboursMap = Long2ObjectOpenHashMap[NeighbourSet]

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

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  10. def getWithNeighbours[VD, ED](graph: Graph[VD, ED], treatAsUndirected: Boolean = false, vertexPredicate: SimpleVertexPredicate = AllPathPredicate)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED]): Graph[NeighbourSet, ED]

    Permalink

    Computes first level neighbours for each vertex

    Computes first level neighbours for each vertex

    returns

    graph where vertex is associated with its first level neighbours

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

    Permalink

    Computes second level neighbours for each vertex

    Computes second level neighbours for each vertex

    returns

    returns map of first level neighbours to their neighbours

  12. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  14. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  15. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  16. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  17. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  18. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  19. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  20. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long): Unit

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

Inherited from AnyRef

Inherited from Any

Ungrouped