Abstract Value Members
-
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
filterHyperRelations[START <: Node, STARTRELATION <: Relation[START, HYPERRELATION], HYPERRELATION <: HyperRelation[START, STARTRELATION, HYPERRELATION, ENDRELATION, END], ENDRELATION <: Relation[HYPERRELATION, END], END <: Node](nodes: Set[graph.Node], relations: Set[graph.Relation], hyperRelationFactory: HyperRelationFactory[START, STARTRELATION, HYPERRELATION, ENDRELATION, END]): Set[HYPERRELATION]
-
def
filterNodes[T <: Node](nodes: Set[graph.Node], nodeFactory: NodeFactory[T]): Set[T]
-
def
filterRelations[START <: Node, RELATION <: Relation[START, END], END <: Node](relations: Set[graph.Relation], relationFactory: RelationFactory[START, RELATION, END]): Set[RELATION]
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
-
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
label: Label
-
final
def
ne(arg0: AnyRef): Boolean
-
def
neighboursAs[T <: Node](nodeFactory: NodeFactory[T]): Set[T]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
predecessorsAs[T <: Node](nodeFactory: NodeFactory[T]): Set[T]
-
def
successorsAs[T <: Node](nodeFactory: NodeFactory[T]): Set[T]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any