object GraphUtil
- Alphabetic
- By Inheritance
- GraphUtil
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
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[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
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
includingstarts
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
includingstarts
themselves
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
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
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()