Packages

abstract class GraphMatcher extends AnyRef

The GraphMatcher abstract class serves as a template for implementing specific algorithms for graph pattern matching.

Linear Supertypes
AnyRef, Any
Known Subclasses
DualIso, DualIsoCAR, DualSim, DualSim2, DualSim2CAR, GraphSim, GraphSim2, GraphSimIso, StrictSim, StrictSim2, TightSim, TightSim2
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphMatcher
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

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

    g

    the data graph G(V, E, l) with vertices v in V

    q

    the query graph Q(U, D, k) with vertices u in U

Abstract Value Members

  1. abstract 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 }

Concrete 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
  5. val LIMIT: Double
    Attributes
    protected
  6. val SELF_LOOPS: Boolean
    Attributes
    protected
  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'.

  9. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  10. 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

  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: AnyRef): 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.

  14. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  15. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. 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}'.

  18. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  20. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  21. 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

  22. val qRange: Range
    Attributes
    protected
  23. 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

  24. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  25. 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

  26. def toString(): String
    Definition Classes
    AnyRef → Any
  27. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  28. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

Inherited from AnyRef

Inherited from Any

Ungrouped