Graphs

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. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. def dagDepth[T](nodes: Iterable[T])(nf: (T) ⇒ Iterable[T]): Map[T, Int]

   Return the depth of each node in the dag.

   Return the depth of each node in the dag. a node that has no dependencies has depth == 0 else it is max of parent + 1

   Behavior is not defined if the graph is not a DAG (for now, it runs forever, may throw later)

9. def depthFirstOf[T](t: T)(nf: (T) ⇒ Iterable[T]): List[T]

   Return the depth first enumeration of reachable nodes, NOT INCLUDING INPUT, unless it can be reached via neighbors

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

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

12. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyRef → Any

14. def hashCode(): Int

    Definition Classes

    AnyRef → Any

15. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    AnyRef

17. final def notify(): Unit

    Definition Classes

    AnyRef

18. final def notifyAll(): Unit

    Definition Classes

    AnyRef

19. def reversed[T](nodes: Iterable[T])(nf: (T) ⇒ Iterable[T]): (T) ⇒ Iterable[T]

    Return a NeighborFn for the graph of reversed edges defined by this set of nodes and nf We avoid Sets which use hash-codes which may depend on addresses which are not stable from one run to the next.

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

    Definition Classes

    AnyRef

21. def toString(): String

    Definition Classes

    AnyRef → Any

22. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )