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

   

   add edge Current Graph is changed.

5. def addEdge(edge: (N, E, N)): Unit

   

   Add a edge Current Graph is changed.

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

   

   Add another graph Current graph is changed.

7. def addVertex(vertex: N): Unit

   

   Add a vertex Current Graph is changed.

8. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

9. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

10. def copy: Graph[N, E]

    

    clone the graph

11. def edges: List[(N, E, N)]

    

    all edges

12. def edgesOf(node: N): List[(N, E, N)]

    

    edges connected to node

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

    

    Definition Classes

    AnyRef

14. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

15. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

17. def hasCycle(): Boolean

    

    check whether there is a loop

18. def hasDuplicatedEdge(): Boolean

    

    Check whether there are two edges connecting two nodes.

19. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

20. def inDegreeOf(node: N): Int

    

    in degree

21. def incomingEdgesOf(node: N): List[(N, E, N)]

    

    incoming edges.

22. def isEmpty: Boolean

    

    check empty

23. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Map a graph to a new graph, with edge converted to new type Current graph is not changed.

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

    

    Map a graph to a new graph, with vertex converted to a new type Current Graph is not changed.

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

    

    Definition Classes

    AnyRef

27. final def notify(): Unit

    

    Definition Classes

    AnyRef

28. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

29. def outDegreeOf(node: N): Int

    

    out degree

30. def outgoingEdgesOf(node: N): List[(N, E, N)]

    

    out going edges.

31. def removeVertex(node: N): Unit

    

    Remove vertex Current Graph is changed.

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

    

    replace vertex, the current Graph is mutated.

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

    

    sub-graph which contains current node and all neighbour nodes and edges.

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

    

    Definition Classes

    AnyRef

35. def toString(): String

    

    Definition Classes

    Graph → AnyRef → Any

36. def topologicalOrderIterator: Iterator[N]

    

    Return an iterator of vertex in topological order The node returned by Iterator is stable sorted.

37. def topologicalOrderWithCirclesIterator: Iterator[N]

    

    Return an iterator of vertex in topological order of graph with circles The node returned by Iterator is stable sorted.

    Return an iterator of vertex in topological order of graph with circles The node returned by Iterator is stable sorted.

    The reference of this algorithm is: http://www.drdobbs.com/database/topological-sorting/184410262

38. def vertexHierarchyLevelMap(): Map[N, Int]

    

    Generate a level map for each vertex withholding:

    Generate a level map for each vertex withholding:

    if vertex A -> B, then level(A) -> level(B)

39. def vertices: List[N]

    

    return all vertices.

    return all vertices. The result is stable

40. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )