Object

scalan.util

GraphUtil

Related Doc: package util

Permalink

object GraphUtil

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphUtil
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def depthFirstOrderFrom[A](starts: Buffer[A], neighbours: DFunc[A, Buffer[A]])(implicit arg0: ClassTag[A]): Buffer[A]

    Permalink

    Collect and topologically order all reachable nodes starting form the given nodes and following the given neighbours relations.

    Collect and topologically order all reachable nodes starting form the given nodes and following the given neighbours relations. Depth first search algorithm is used.

    A

    type of value representing node, should implement equality which is used in debox.Set

    starts

    starting nodes for the search

    neighbours

    a function representing the adjacency matrix of the graph

    returns

    Topologically ordered sequence of nodes reachable from the starts including starts themselves

  7. def depthFirstSetFrom[A](starts: Buffer[A])(neighbours: DFunc[A, Buffer[A]])(implicit arg0: ClassTag[A]): Set[A]

    Permalink

    Build a set of reachable nodes starting form the given nodes and following the given neighbours relations.

    Build a set of reachable nodes starting form the given nodes and following the given neighbours relations. Depth first search algorithm is used.

    A

    type of value representing node, should implement equality which is used in debox.Set

    starts

    starting nodes for the search

    neighbours

    a function representing the adjacency matrix of the graph

    returns

    Set of nodes reachable from the starts including starts themselves

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

    Permalink
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  12. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  14. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  15. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  16. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  17. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  18. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  19. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  20. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped