data structures

  1. Disjoint Set

    Runs the Disjoint Set (or Union/Find) algorithm on a list of list of IDs, returning a list of the merged sets with at least one element in common.

    gabrielalmeida
  2. Graph Inductive Scala

    Inductive graph implementation based on Martin Erwig's paper: * http://web.engr.oregonstate.edu/~erwig/papers/InductiveGraphs_JFP01.pdf

    BigDataGuru
1-2 of 2
  1. Disjoint Set

    Runs the Disjoint Set (or Union/Find) algorithm on a list of list of IDs, returning a list of the merged sets with at least one element in common.

    gabrielalmeida
  2. Graph Inductive Scala

    Inductive graph implementation based on Martin Erwig's paper: * http://web.engr.oregonstate.edu/~erwig/papers/InductiveGraphs_JFP01.pdf

    BigDataGuru
1-2 of 2
  1. Disjoint Set

    Runs the Disjoint Set (or Union/Find) algorithm on a list of list of IDs, returning a list of the merged sets with at least one element in common.

    gabrielalmeida
  2. Graph Inductive Scala

    Inductive graph implementation based on Martin Erwig's paper: * http://web.engr.oregonstate.edu/~erwig/papers/InductiveGraphs_JFP01.pdf

    BigDataGuru
1-2 of 2