object Informer
- Alphabetic
- By Inheritance
- Informer
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Type Members
- trait BfsInformer extends NodeInformer
Extended node visitor informer for breath first searches.
- case class CycleStackElem(node: NodeT, edges: Iterable[GraphTraversal.EdgeT]) extends NodeElement with Product with Serializable
- type Depth = Int
- trait DfsInformer extends NodeInformer
Extended node visitor informer for depth first searches.
- abstract class DijkstraInformer[T] extends NodeInformer
Extended node visitor informer for calculating shortest paths.
Extended node visitor informer for calculating shortest paths. This informer always returns
0
fordepth
. - trait NodeElement extends AnyRef
- abstract class TarjanInformer extends NodeInformer
Extended node visitor informer for Tarjan's algorithm.
- trait WgbInformer extends NodeInformer
Extended node visitor informer for cycle detecting.
Extended node visitor informer for cycle detecting. This informer always returns
0
fordepth
.
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(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @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
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @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(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- object BfsInformer
- object CycleStackElem extends Serializable
- object DfsInformer
- object DijkstraInformer
- object TarjanInformer
- object WgbInformer
Welcome to the Graph for Scala API reference. Some suggested entry points:
AnyGraph
immutable.Graph
and its inner nodesmutable.Graph
and its inner nodes.edges
package and its subpackageshyperedges
package and its subpackages.labeled edges
packagemultilabeled edges
packagelabeled hyperedges
packagemultilabeled hyperedges
packageordered labeled hyperedges
packageordered multilabeled hyperedges
objectgeneric
package.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.