GraphOps

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

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

   Definition Classes

   AnyRef

7. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

8. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

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

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

   

   Definition Classes

   AnyRef → Any

10. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

11. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

12. def isReachable[A](next: (A) ⇒ Set[A], source: A, target: A): Boolean

    

    Returns true if there is a path from source to target.

    Returns true if there is a path from source to target.

    next

    A function giving the nodes directly accessible from a given node

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

    

    Definition Classes

    AnyRef

14. final def notify(): Unit

    

    Definition Classes

    AnyRef

15. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

16. def reachable[A](next: (A) ⇒ Set[A], source: A): Set[A]

    

    Returns the set of reachable nodes from a given node, not including the node itself (unless it is member of a cycle)

    Returns the set of reachable nodes from a given node, not including the node itself (unless it is member of a cycle)

    next

    A function giving the nodes directly accessible from a given node

    source

    The source from which to begin the search

17. def sinks[A](graph: Map[A, Set[A]]): Set[A]

    

18. def sources[A](graph: Map[A, Set[A]]): Set[A]

    

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

    

    Definition Classes

    AnyRef

20. def toString(): String

    

    Definition Classes

    AnyRef → Any

21. def topologicalSorting[A](toPreds: Map[A, Set[A]]): Either[Set[A], Seq[A]]

    

    Takes an graph in form of a map (vertex -> out neighbors).

    Takes an graph in form of a map (vertex -> out neighbors). Returns a topological sorting of the vertices (Right value) if there is one. If there is none, it returns the set of vertices that belong to a cycle or come before a cycle (Left value)

22. def transitiveClosure[A](graph: Map[A, Set[A]]): Map[A, Set[A]]

    

23. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )