com.soundcloud.spark.pagerank

PageRankGraph

object PageRankGraph extends Serializable

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

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. def fromEdgesWithUniformPriors(edges: EdgeRDD, tmpStorageLevel: StorageLevel, edgesStorageLevel: StorageLevel, verticesStorageLevel: StorageLevel): PageRankGraph

    Given the edges of a graph, builds vertices with uniformly distributed values and dangling nodes flags.

    Given the edges of a graph, builds vertices with uniformly distributed values and dangling nodes flags. This can be used as a starting point for the first iteration of PageRank.

    Performance note: edges are iterated over multiple timed, so please consider persisting it first.

    edges

    the EdgeRDD to use as the basis for the graph

    tmpStorageLevel

    the storage level to use for temporary datasets that are created during the graph building process (we recommend using MEMORY_ONLY as the datasets are small)

    edgesStorageLevel

    the storage level to use for the final edges produced

    verticesStorageLevel

    the storage level to use for the final vertices produced

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

    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int

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

    Definition Classes
    Any
  15. def load(spark: SparkSession, path: String, edgesStorageLevel: StorageLevel, verticesStorageLevel: StorageLevel): PageRankGraph

    Loads a graph from durable storage.

    Loads a graph from durable storage.

    See: save for more details

  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. def save(spark: SparkSession, graph: PageRankGraph, path: String): Unit

    Saves a graph in it's entirety to durable storage.

    Saves a graph in it's entirety to durable storage.

    Note that this uses "object files" and is thus loading the graph requires the samve binary version as Spark and this library that was used to save it.

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

    Definition Classes
    AnyRef
  21. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped