Class

razie.g

NoCyclesGraphLike

Related Doc: package g

Permalink

class NoCyclesGraphLike[N <: GNode[N, L], L <: GLink[N]] extends GraphLike[N, L]

Wraps a graph so then I can traverse each node just once, even if the original graph had cycles

it will index the nodes as it traverses them, to avoid walking the same path twice.

This is excellent for example for printing graphs or doing any operation where you just want to visit the nodes and not worry about cycles and stack overflows...

Linear Supertypes
GraphLike[N, L], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NoCyclesGraphLike
  2. GraphLike
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NoCyclesGraphLike(target: GraphLike[N, L])

    Permalink

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 collect(n: N, from: Option[L]): Equals with Serializable

    Permalink
    Attributes
    protected
  7. def colored: (N) ⇒ Boolean

    Permalink
    Definition Classes
    NoCyclesGraphLikeGraphLike
  8. def dag: NoCyclesGraphLike[N, L]

    Permalink
    Definition Classes
    GraphLike
  9. def depth(maxDepth: Int): DepthGraphLike[N, L]

    Permalink
    Definition Classes
    GraphLike
  10. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  12. def filterNodes(f: (N) ⇒ Boolean): Seq[N]

    Permalink
    Definition Classes
    GraphLike
  13. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. def foreach(fn: (N, Int) ⇒ Unit, fl: (L, Int) ⇒ Unit): Unit

    Permalink
    Definition Classes
    GraphLike
  15. def foreachNode(fn: (N, Int) ⇒ Unit): Unit

    Permalink
    Definition Classes
    GraphLike
  16. final def getClass(): Class[_]

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

    Permalink
    Definition Classes
    AnyRef → Any
  18. def iforeach(n: N, from: Option[L], fn: (N, Int) ⇒ Unit, fl: (L, Int) ⇒ Unit, level: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    NoCyclesGraphLikeGraphLike
  19. val index: HashMap[Any, ListBuffer[L]]

    Permalink
  20. def indexed: IndexedGraphLike[N, L]

    Permalink
    Definition Classes
    GraphLike
  21. def isCollected(n: N, from: Option[L]): Boolean

    Permalink
    Attributes
    protected
  22. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  23. def isNodeCollected(n: N): Boolean

    Permalink
    Attributes
    protected
  24. def mkString: String

    Permalink

    paint a graph old school - tree style: you better give me a DAG :)

    paint a graph old school - tree style: you better give me a DAG :)

    Definition Classes
    GraphLike
  25. def mkString2: String

    Permalink

    paint a graph old school - tree style: you better give me a DAG :)

    paint a graph old school - tree style: you better give me a DAG :)

    Definition Classes
    GraphLike
  26. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  29. def notin(l: Any, i: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  30. def pt(s: String, i: Int): String

    Permalink
    Definition Classes
    GraphLike
  31. def root: N

    Permalink
    Definition Classes
    NoCyclesGraphLikeGraphLike
  32. final def synchronized[T0](arg0: ⇒ T0): T0

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

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

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

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

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

Inherited from GraphLike[N, L]

Inherited from AnyRef

Inherited from Any

Ungrouped