Packages

class DualIsoCAR extends GraphMatcher

The DualIsoCAR classes used DualSim2CAR for pruning, otherwise it works like DualIso, which uses DualSim2 for pruning.

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

Instance Constructors

  1. new DualIsoCAR(g: Graph, q: Graph)

    g

    the data graph G

    q

    the query graph Q

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 the Dual Subgraph Isomorphism algorithm to find subgraphs of data graph 'g' that isomorphically match query graph 'q'.

    Apply the Dual Subgraph Isomorphism 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
    DualIsoCARGraphMatcher
  9. def bijectionsWithSets(): Set[Array[Int]]

    Find bijections using the more restricted 'feasibleMatesWithSets' method.

  10. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  11. def disjoint(set1: Set[Int], set2: Set[Int]): Boolean

    Determine whether two sets are disjoint, i.e., have an empty intersection.

    Determine whether two sets are disjoint, i.e., have an empty intersection.

    set1

    the first set

    set2

    the second set

    Definition Classes
    GraphMatcher
  12. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  14. 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
  15. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  17. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  18. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  19. def mappings(): Array[Set[Int]]

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

    Apply the Dual Subgraph Isomorphism 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
    DualIsoCARGraphMatcher
  20. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  21. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  22. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  23. def numMatches(): Int

    Return the count of the number of matches.

  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]]

    The method from dual cardinality simulation is used for pruning.

    The method from dual cardinality simulation is used for pruning.

    phi

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

    Definition Classes
    DualIsoCARGraphMatcher
  26. val qRange: Range
    Attributes
    protected
    Definition Classes
    GraphMatcher
  27. def setLimit(_limit: Int): Unit

    Set an upper bound on the number matches to allow before quitting.

    Set an upper bound on the number matches to allow before quitting.

    _limit

    the number of matches before quitting

  28. def showMappings(phi: Array[Set[Int]]): Unit

    Show the mappings between a query graph vertex u and a set of data graph vertices {v}.

    Show the mappings between a query graph vertex u and a set of data graph vertices {v}.

    phi

    the set-valued mapping function

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

    Test the graph pattern matcher.

    Test the graph pattern matcher.

    name

    the name of graph pattern matcher

    ans

    the correct answer

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

Inherited from GraphMatcher

Inherited from AnyRef

Inherited from Any

Ungrouped