object LabelFunctions
The LabelFunctions object provides methods for obtaining child and
parents labels for the corresponding data and query graphs.
- Alphabetic
- By Inheritance
- LabelFunctions
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
gChildLabels[TLabel](g: Graph[TLabel], v: Int, u: Int, chu: Set[Int], phi: Array[Set[Int]])(implicit arg0: ClassTag[TLabel]): MultiSet[TLabel]
Given the value of query vertex, graph vertex and phi, it returns the child labels of the data graph corresponding to the child labels of query graph.
Given the value of query vertex, graph vertex and phi, it returns the child labels of the data graph corresponding to the child labels of query graph.
- g
data graph
- v
data graph vertex
- u
query graph vertex
- chu
children of vertex u
- phi
array of mappings from a query vertex u to { data graph vertices v }
-
def
gParentLabels[TLabel](g: Graph[TLabel], v: Int, u: Int, pau: Set[Int], phi: Array[Set[Int]])(implicit arg0: ClassTag[TLabel]): MultiSet[TLabel]
Given the value of query vertex, graph vertex and phi, it returns the parent labels of the data graph corresponding to the parent labels of query graph.
Given the value of query vertex, graph vertex and phi, it returns the parent labels of the data graph corresponding to the parent labels of query graph.
- g
data graph
- v
data graph vertex
- u
query graph vertex
- pau
parents of vertex u
- phi
array of mappings from a query vertex u to { data graph vertices v }
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
qChildLabels[TLabel](q: Graph[TLabel], u: Int)(implicit arg0: ClassTag[TLabel]): MultiSet[TLabel]
Given the query graph and value of query vertex it returns its corresponding child labels.
Given the query graph and value of query vertex it returns its corresponding child labels.
- q
query graph
- u
query graph vertex
-
def
qParentLabels[TLabel](q: Graph[TLabel], u: Int)(implicit arg0: ClassTag[TLabel]): MultiSet[TLabel]
Given the query graph and value of query vertex it returns its corresponding parent labels.
Given the query graph and value of query vertex it returns its corresponding parent labels.
- q
query graph
- u
query graph vertex
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )