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 add_deps_acyclic(y: Key, xs: List[Key]): Graph[Key, A]

   

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

   

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

   

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

   

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

   

9. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

10. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

12. def defined(x: Key): Boolean

    

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

    

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

    

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

    

16. def domain: Set[Key]

    

17. def edges_iterator: Iterator[(Key, 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_isolated(x: Key): Boolean

    

32. def is_maximal(x: Key): Boolean

    

33. def is_minimal(x: Key): Boolean

    

34. def iterator: Iterator[(Key, Entry)]

    

35. def keys: List[Key]

    

36. def keys_iterator: Iterator[Key]

    

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

    

38. def maximals: List[Key]

    

39. def minimals: List[Key]

    

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

    

    Definition Classes

    AnyRef

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

    

42. final def notify(): Unit

    

    Definition Classes

    AnyRef

43. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

44. def ordering: Ordering[Key]

    

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

    

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

    

47. def size: Int

    

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

    

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

    

    Definition Classes

    AnyRef

50. def toString(): String

    

    Definition Classes

    Graph → AnyRef → Any

51. def topological_order: List[Key]

    

52. def transitive_closure: Graph[Key, A]

    

53. def transitive_reduction_acyclic: Graph[Key, A]

    

54. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )