GraphUtil

Value Members

final def !=(arg0: Any): Boolean

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

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

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

Definition Classes
Any
def clone(): AnyRef

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

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
def depthFirstSetFrom[A](starts: Buffer[A])(neighbours: DFunc[A, Buffer[A]])(implicit arg0: ClassTag[A]): Set[A]

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
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def hashCode(): Int

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
final def isInstanceOf[T0]: Boolean

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(arg0: Long, arg1: Int): Unit

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

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Doc: package util

object GraphUtil

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def depthFirstOrderFrom[A](starts: Buffer[A], neighbours: DFunc[A, Buffer[A]])(implicit arg0: ClassTag[A]): Buffer[A]

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

Deprecated Value Members

def finalize(): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped