Packages

class GraphSimCAR[TLabel] extends GraphMatcher[TLabel]

The GraphSimCAR class provides an implementation for Simple Graph Simulation.

Linear Supertypes
GraphMatcher[TLabel], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphSimCAR
  2. GraphMatcher
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GraphSimCAR(g: Graph[TLabel], q: Graph[TLabel])(implicit arg0: ClassTag[TLabel])

    g

    the data graph G(V, E, l)

    q

    the query graph Q(U, D, k)

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. val CHECK: Int
    Attributes
    protected
    Definition Classes
    GraphMatcher
  5. val LIMIT: Double
    Attributes
    protected
    Definition Classes
    GraphMatcher
  6. val SELF_LOOPS: Boolean
    Attributes
    protected
    Definition Classes
    GraphMatcher
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. def bijections(): Set[Array[Int]]

    Apply a graph pattern matching algorithm to find subgraphs of data graph 'g' that isomorphically match query graph 'q'.

    Apply a graph pattern matching algorithm to find subgraphs of data graph 'g' that isomorphically match query graph 'q'. These are represented by a set of single-valued bijections {'psi'} where each 'psi' function maps each query graph vertex 'u' to a data graph vertices 'v'.

    Definition Classes
    GraphMatcher
  9. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def countMappings(phi: Array[Set[Int]]): Pair

    Count the number of mappings between query graph vertices 'u_i' and their sets of data graph vertices {v}, giving the number of distinct vertices and edges.

    Count the number of mappings between query graph vertices 'u_i' and their sets of data graph vertices {v}, giving the number of distinct vertices and edges.

    phi

    the set-valued mapping function

    Definition Classes
    GraphMatcher
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. def feasibleMates(): Array[Set[Int]]

    Create an initial array of feasible mappings 'phi' from each query vertex 'u' to the corresponding set of data graph vertices '{v}' whose label matches 'u's.

    Create an initial array of feasible mappings 'phi' from each query vertex 'u' to the corresponding set of data graph vertices '{v}' whose label matches 'u's.

    Definition Classes
    GraphMatcher
  14. def feasibleMatesW(): Array[Set[Int]]

    Create an initial array of feasible mappings 'phi' from each query vertex 'u' to the corresponding set of data graph vertices '{v}' whose label matches 'u's.

    Create an initial array of feasible mappings 'phi' from each query vertex 'u' to the corresponding set of data graph vertices '{v}' whose label matches 'u's. This version handles query graph labels that have wildcards.

    Definition Classes
    GraphMatcher
  15. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. val gRange: Range
    Attributes
    protected
    Definition Classes
    GraphMatcher
  17. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  18. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  19. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  20. def mappings(): Array[Set[Int]]

    Apply a graph pattern matching algorithm to find the mappings from the query graph 'q' to the data graph 'g'.

    Apply a graph pattern matching algorithm to find the mappings from the query graph 'q' to the data graph 'g'. These are represented by a multi-valued function 'phi' that maps each query graph vertex 'u' to a set of data graph vertices '{v}'.

    Definition Classes
    GraphMatcher
  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. final def notify(): Unit
    Definition Classes
    AnyRef
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  24. def overlaps(set1: Set[Int], set2: Set[Int]): Boolean

    Determine whether two sets overlap, i.e., have a non-empty intersection.

    Determine whether two sets overlap, i.e., have a non-empty intersection.

    set1

    the first set

    set2

    the second set

    Definition Classes
    GraphMatcher
  25. def prune(phi: Array[Set[Int]]): Array[Set[Int]]

    Given the mappings 'phi' produced by the 'feasibleMates' method, prune mappings 'u -> v' where v's children fail to match u's.

    Given the mappings 'phi' produced by the 'feasibleMates' method, prune mappings 'u -> v' where v's children fail to match u's.

    phi

    array of mappings from a query vertex u to { graph vertices v }

    Definition Classes
    GraphSimCARGraphMatcher
  26. val qRange: Range
    Attributes
    protected
    Definition Classes
    GraphMatcher
  27. def showMappings(phi: Array[Set[Int]]): Unit

    Show all mappings between query graph vertices 'u_i' and their sets of data graph vertices {v}.

    Show all mappings between query graph vertices 'u_i' and their sets of data graph vertices {v}.

    phi

    the set-valued mapping function

    Definition Classes
    GraphMatcher
  28. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  29. def test(name: String, ans: Array[Set[Int]] = null): Unit

    Test the Graph Pattern Matcher.

    Test the Graph Pattern Matcher.

    ans

    the correct answer

    Definition Classes
    GraphMatcher
  30. def toString(): String
    Definition Classes
    AnyRef → Any
  31. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from GraphMatcher[TLabel]

Inherited from AnyRef

Inherited from Any

Ungrouped