Graph

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. def addEdge(node1: N, edge: E, node2: N): Unit

   

5. def addGraph(other: Graph[N, E]): Graph[N, E]

   

6. def addVertex(vertex: N): Unit

   

7. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

9. def copy: Graph[N, E]

   

10. def edges: Array[(N, E, N)]

    

11. def edgesOf(node: N): Array[(N, E, N)]

    

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

    

    Definition Classes

    AnyRef

13. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

14. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

16. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

17. def inDegreeOf(node: N): Int

    

18. def incomingEdgesOf(node: N): Array[(N, E, N)]

    

19. def isEmpty: Boolean

    

20. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

21. def mapEdge[NewEdge](fun: (N, E, N) ⇒ NewEdge): Graph[N, NewEdge]

    

    Map a graph to a new graph, with edge converted to new type

    Map a graph to a new graph, with edge converted to new type

    NewEdge

    fun

    returns

22. def mapVertex[NewNode](fun: (N) ⇒ NewNode): Graph[NewNode, E]

    

    Map a graph to a new graph, with vertex converted to a new type

    Map a graph to a new graph, with vertex converted to a new type

    NewNode

    fun

    returns

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

    

    Definition Classes

    AnyRef

24. final def notify(): Unit

    

    Definition Classes

    AnyRef

25. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

26. def outDegreeOf(node: N): Int

    

27. def outgoingEdgesOf(node: N): Array[(N, E, N)]

    

28. def removeVertex(node: N): Unit

    

29. def replaceVertex(node: N, newNode: N): Graph[N, E]

    

30. def subGraph(node: N): Graph[N, E]

    

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

    

    Definition Classes

    AnyRef

32. def toString(): String

    

    Definition Classes

    Graph → AnyRef → Any

33. def topologicalOrderIterator: TopologicalOrderIterator[N, Edge[E]]

    

    Return an iterator of vertex in topological order

34. def vertices: Iterable[N]

    

35. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )