scalation.graphalytics

DualIso

class DualIso extends PatternMatcher

The DualIso class provides an implementation for Subgraph Isomorphism that uses Dual Graph Simulation for pruning.

Linear Supertypes
PatternMatcher, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. DualIso
  2. PatternMatcher
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

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

    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
    PatternMatcher
  5. val LIMIT: Double

    Attributes
    protected
    Definition Classes
    PatternMatcher
  6. val SELF_LOOPS: Boolean

    Attributes
    protected
    Definition Classes
    PatternMatcher
  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 bijective functions {'psi'} where each 'psi' function maps each query graph vertex 'u' to a data graph vertices 'v'.

    Definition Classes
    DualIsoPatternMatcher
  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  12. def feasibleMates(): Array[ISet]

    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
    PatternMatcher
  13. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  15. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  16. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  17. def mappings(): Array[ISet]

    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
    DualIsoPatternMatcher
  18. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  19. final def notify(): Unit

    Definition Classes
    AnyRef
  20. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  21. def numMatches(): Int

    Return the count of the number of matches.

  22. val qRange: Range

    Attributes
    protected
    Definition Classes
    PatternMatcher
  23. def setLimit(_limit: Int): Unit

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

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

    _limit

    the number of matches before quiting

  24. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  25. def toString(): String

    Definition Classes
    AnyRef → Any
  26. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from PatternMatcher

Inherited from AnyRef

Inherited from Any

Ungrouped