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: streaming.Processor[_ <: task.Task], edge: Partitioner, node2: streaming.Processor[_ <: task.Task]): Unit

   

   Definition Classes

   Graph

5. def addGraph(other: util.Graph[streaming.Processor[_ <: task.Task], Partitioner]): util.Graph[streaming.Processor[_ <: task.Task], Partitioner]

   

   Definition Classes

   Graph

6. def addVertex(vertex: streaming.Processor[_ <: task.Task]): Unit

   

   Definition Classes

   Graph

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: util.Graph[streaming.Processor[_ <: task.Task], Partitioner]

   

   Definition Classes

   Graph

10. def edges: List[(streaming.Processor[_ <: task.Task], Partitioner, streaming.Processor[_ <: task.Task])]

    

    Definition Classes

    Graph

11. def edgesOf(node: streaming.Processor[_ <: task.Task]): List[(streaming.Processor[_ <: task.Task], Partitioner, streaming.Processor[_ <: task.Task])]

    

    Definition Classes

    Graph

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 hasCycle(): Boolean

    

    Definition Classes

    Graph

17. def hasDuplicatedEdge(): Boolean

    

    Definition Classes

    Graph

18. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

19. def inDegreeOf(node: streaming.Processor[_ <: task.Task]): Int

    

    Definition Classes

    Graph

20. def incomingEdgesOf(node: streaming.Processor[_ <: task.Task]): List[(streaming.Processor[_ <: task.Task], Partitioner, streaming.Processor[_ <: task.Task])]

    

    Definition Classes

    Graph

21. def isEmpty: Boolean

    

    Definition Classes

    Graph

22. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

23. def mapEdge[NewEdge](fun: (streaming.Processor[_ <: task.Task], Partitioner, streaming.Processor[_ <: task.Task]) ⇒ NewEdge): util.Graph[streaming.Processor[_ <: task.Task], NewEdge]

    

    Definition Classes

    Graph

24. def mapVertex[NewNode](fun: (streaming.Processor[_ <: task.Task]) ⇒ NewNode): util.Graph[NewNode, Partitioner]

    

    Definition Classes

    Graph

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

    

    Definition Classes

    AnyRef

26. final def notify(): Unit

    

    Definition Classes

    AnyRef

27. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

28. def outDegreeOf(node: streaming.Processor[_ <: task.Task]): Int

    

    Definition Classes

    Graph

29. def outgoingEdgesOf(node: streaming.Processor[_ <: task.Task]): List[(streaming.Processor[_ <: task.Task], Partitioner, streaming.Processor[_ <: task.Task])]

    

    Definition Classes

    Graph

30. def removeVertex(node: streaming.Processor[_ <: task.Task]): Unit

    

    Definition Classes

    Graph

31. def replaceVertex(node: streaming.Processor[_ <: task.Task], newNode: streaming.Processor[_ <: task.Task]): util.Graph[streaming.Processor[_ <: task.Task], Partitioner]

    

    Definition Classes

    Graph

32. def subGraph(node: streaming.Processor[_ <: task.Task]): util.Graph[streaming.Processor[_ <: task.Task], Partitioner]

    

    Definition Classes

    Graph

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

    

    Definition Classes

    AnyRef

34. def toString(): String

    

    Definition Classes

    Graph → AnyRef → Any

35. def topologicalOrderIterator: Iterator[streaming.Processor[_ <: task.Task]]

    

    Definition Classes

    Graph

36. def vertexHierarchyLevelMap(): Map[streaming.Processor[_ <: task.Task], Int]

    

    Definition Classes

    Graph

37. def vertices: List[streaming.Processor[_ <: task.Task]]

    

    Definition Classes

    Graph

38. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )