com.twitter.cassovary

algorithms

package algorithms

Visibility
  1. Public
  2. All

Type Members

  1. class IntTuplesArray extends Iterable[Seq[Int]]

    A wrapper of an array of tuples used to save memory.

  2. case class PageRankParams(dampingFactor: Double = 0.85, iterations: Option[Int] = Some(10)) extends Product with Serializable

    Parameters for PageRank

    Parameters for PageRank

    dampingFactor

    Probability of NOT randomly jumping to another node

    iterations

    How many PageRank iterations do you want?

  3. class TriangleCount extends AnyRef

  4. case class TriangleCountParameters(edgeReservoirSize: Int, wedgeReservoirSize: Int) extends Product with Serializable

Value Members

  1. object PageRank

    PageRank is a link analysis algorithm designed to measure the importance of nodes in a graph.

    PageRank is a link analysis algorithm designed to measure the importance of nodes in a graph. Popularized by Google.

    Unoptimized for now, and runs in a single thread.

  2. object TriangleCount

    Implementation of approximated triangle counting algorithm by Madhav Jha et al.

    Implementation of approximated triangle counting algorithm by Madhav Jha et al. http://arxiv.org/pdf/1212.2264v3.pdf

    We assume that graph is undirected, formally if edge (a, b) is in graph than (b, a) is also.

Ungrouped