Graph

Value Members

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

6. def add_deps_acyclic(y: Key, xs: List[Key]): Graph[Key, A]

7. def add_edge(x: Key, y: Key): Graph[Key, A]

8. def add_edge_acyclic(x: Key, y: Key): Graph[Key, A]

9. def all_preds(xs: List[Key]): List[Key]

10. def all_succs(xs: List[Key]): List[Key]

11. final def asInstanceOf[T0]: T0

    Definition Classes

    Any

12. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

13. def default_node(x: Key, info: A): Graph[Key, A]

14. def defined(x: Key): Boolean

15. def del_edge(x: Key, y: Key): Graph[Key, A]

16. def del_node(x: Key): Graph[Key, A]

17. def dest: List[((Key, A), List[Key])]

18. def empty_keys: Keys

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

    Definition Classes

    AnyRef

20. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

21. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyRef → Any

23. def get_node(x: Key): A

24. def hashCode(): Int

    Definition Classes

    AnyRef → Any

25. def imm_preds(x: Key): Keys

26. def imm_succs(x: Key): Keys

27. def irreducible_paths(x: Key, y: Key): List[List[Key]]

28. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

29. def is_edge(x: Key, y: Key): Boolean

30. def is_empty: Boolean

31. def is_maximal(x: Key): Boolean

32. def is_minimal(x: Key): Boolean

33. def iterator: Iterator[(Key, (A, (Keys, Keys)))]

34. def keys: List[Key]

35. def keys_iterator: Iterator[Key]

36. def map_node(x: Key, f: (A) ⇒ A): Graph[Key, A]

37. def maximals: List[Key]

38. def minimals: List[Key]

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

    Definition Classes

    AnyRef

40. def new_node(x: Key, info: A): Graph[Key, A]

41. final def notify(): Unit

    Definition Classes

    AnyRef

42. final def notifyAll(): Unit

    Definition Classes

    AnyRef

43. def ordering: Ordering[Key]

44. def reachable(next: (Key) ⇒ Keys, xs: List[Key]): (List[List[Key]], Keys)

45. def restrict(pred: (Key) ⇒ Boolean): Graph[Key, A]

46. def strong_conn: List[List[Key]]

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

    Definition Classes

    AnyRef

48. def toString(): String

    Definition Classes

    Graph → AnyRef → Any

49. def topological_order: List[Key]

50. def transitive_closure: Graph[Key, A]

51. def transitive_reduction_acyclic: Graph[Key, A]

52. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )