Packages

class GraphSimIso extends GraphMatcher

The GraphSimIso object provides an implementation for Subgraph Isomorphism that uses an adjacency set version of Ullmann's Algorithm.

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

Instance Constructors

  1. new GraphSimIso(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
    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 Ullmann's Subgraph Isomorphism algorithm to find subgraphs of data graph 'g' that isomorphically match query graph 'q'.

    Apply the Ullmann's 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
    GraphSimIsoGraphMatcher
  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[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
  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 getMatches(): Int

    Get the count of the number of matches.

  16. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  17. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  18. def makeOrder(): Array[Int]

    Establish a vertex order from largest to smallest adjacency set ('ch') size.

  19. def mappings(): Array[Set[Int]]

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

    Apply the Ullmann's 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
    GraphSimIsoGraphMatcher
  20. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  21. final def notify(): Unit
    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  23. val qRange: Range
    Attributes
    protected
    Definition Classes
    GraphMatcher
  24. 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
  25. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  26. 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
  27. def toString(): String
    Definition Classes
    AnyRef → Any
  28. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from GraphMatcher

Inherited from AnyRef

Inherited from Any

Ungrouped