Graph

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. def +=(path: Path): Unit

   

4. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def canEqual(other: Any): Boolean

   

7. def changes: Seq[GraphChange]

   

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

9. def degree(node: Node): Int

   

10. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

11. def equals(other: Any): Boolean

    

    Definition Classes

    Graph → AnyRef → Any

12. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

13. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

14. def hashCode(): Int

    

    Definition Classes

    Graph → AnyRef → Any

15. def inDegree(node: Node): Int

    

16. def inRelations(node: Node): AbstractDistinctBufferWithFixedType[Relation, Relations]

    

17. def incidentRelations(node: Node): AbstractDistinctBufferWithFixedType[Relation, Relations]

    

18. def isEmpty: Boolean

    

19. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

20. def merge(that: Graph): Graph

    

21. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

22. def neighbours(node: Node): Buffer[Node]

    

23. val nodes: Nodes

    

24. def nonEmpty: Boolean

    

25. final def notify(): Unit

    

    Definition Classes

    AnyRef

26. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

27. def outDegree(node: Node): Int

    

28. def outRelations(node: Node): AbstractDistinctBufferWithFixedType[Relation, Relations]

    

29. def predecessors(node: Node): Buffer[Node]

    

30. val relations: Relations

    

31. def successors(node: Node): Buffer[Node]

    

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

    

    Definition Classes

    AnyRef

33. def toString(): String

    

    Definition Classes

    Graph → AnyRef → Any

34. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

35. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

36. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )