class
Graph extends AnyRef
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
-
def
clone(): AnyRef
-
def
degree(node: Node): Int
-
def
delete(node: Node): Unit
-
def
delete(relation: Relation): Unit
-
def
deleteRelations(node: Node): Unit
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
inDegree(node: Node): Int
-
def
inRelations(node: Node): Set[Relation]
-
def
incidentRelations(node: Node): Set[Relation]
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
ne(arg0: AnyRef): Boolean
-
def
neighbours(node: Node): Set[Node]
-
val
nodes: Set[Node]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
outDegree(node: Node): Int
-
def
outRelations(node: Node): Set[Relation]
-
def
predecessors(node: Node): Set[Node]
-
val
relations: Set[Relation]
-
def
successors(node: Node): Set[Node]
-
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