Packages

object MatchAnswers

The MatchAnswers object contains answers for the graph matching problem given in the following paper: John A. Miller, Lakshmish Ramaswamy, Arash J.Z. Fard and Krys J. Kochut, "Research Directions in Big Data Graph Analytics," Proceedings of the 4th IEEE International Congress on Big Data (ICBD'15), New York, New York (June-July 2015) pp. 785-794. FIX: merge with Answers.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MatchAnswers
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. val dualIso: Array[Set[Int]]

    Answer for Subgraph Isomorphism

  2. val dualSim: Array[Set[Int]]

    Answer for Dual Graph Simulation

  3. val graphSim: Array[Set[Int]]

    Answer for Graph Simulation

  4. def shift(sim: Array[Set[Int]], offset: Int = -1): Array[Set[Int]]

    Shift the values in the result 'sim' by the offset (e.g., 1 -> 0).

    Shift the values in the result 'sim' by the offset (e.g., 1 -> 0). 'sim' is an array of sets (e.g., set-values functions).

    sim

    the unshifted answer

    offset

    how far to shift the answers

  5. def shiftf(fun: Set[Array[Int]], offset: Int = -1): Set[Array[Int]]

    Shift the values in the result 'fun' by the offset (e.g., 1 -> 0).

    Shift the values in the result 'fun' by the offset (e.g., 1 -> 0). 'fun' is an set of arrays (.e.g., set of bijections).

    fun

    the unshifted answer

    offset

    how far to shift the answers

  6. val strictSim: Array[Set[Int]]

    Answer for Strict Graph Simulation

  7. val tightSim: Array[Set[Int]]

    Answer for Tight Graph Simulation