Class

razie.g

IndexedGraphLike

Related Doc: package g

Permalink

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

DAG - avoids cycles, if any...then I can traverse each node AND LINK just once

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

Instance Constructors

  1. new IndexedGraphLike(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
    Definition Classes
    NoCyclesGraphLike

  7. var collecting: Boolean

    Permalink

  8. def colored: (N) ⇒ Boolean

    Permalink
    Definition Classes
    NoCyclesGraphLike → GraphLike

  9. def dag: NoCyclesGraphLike[N, L]

    Permalink
    Definition Classes
    GraphLike

  10. def depth(maxDepth: Int): DepthGraphLike[N, L]

    Permalink
    Definition Classes
    GraphLike

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

    Permalink
    Definition Classes
    AnyRef

  12. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  13. def filterNodes(f: (N) ⇒ Boolean): Seq[N]

    Permalink
    Definition Classes
    GraphLike

  14. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  15. def foreach(fn: (N, Int) ⇒ Unit, fl: (L, Int) ⇒ Unit): Unit

    Permalink
    Definition Classes
    GraphLike

  16. def foreachNode(fn: (N, Int) ⇒ Unit): Unit

    Permalink
    Definition Classes
    GraphLike

  17. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  18. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  19. def iforeach(n: N, from: Option[L], fn: (N, Int) ⇒ Unit, fl: (L, Int) ⇒ Unit, level: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    IndexedGraphLike → NoCyclesGraphLike → GraphLike

  20. val index: HashMap[Any, ListBuffer[L]]

    Permalink
    Definition Classes
    NoCyclesGraphLike

  21. def indexed: IndexedGraphLike[N, L]

    Permalink
    Definition Classes
    GraphLike

  22. def isCollected(n: N, from: Option[L]): Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    NoCyclesGraphLike

  23. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  24. def isNodeCollected(n: N): Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    NoCyclesGraphLike

  25. 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

  26. 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

  27. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  28. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  29. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  30. def notin(l: Any, i: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike

  31. def pt(s: String, i: Int): String

    Permalink
    Definition Classes
    GraphLike

  32. def root: N

    Permalink
    Definition Classes
    NoCyclesGraphLike → GraphLike

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

    Permalink
    Definition Classes
    AnyRef

  34. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  35. final def wait(): Unit

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

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

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

  37. final def wait(arg0: Long): Unit

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

Inherited from NoCyclesGraphLike[N, L]

Inherited from GraphLike[N, L]

Inherited from AnyRef

Inherited from Any

Ungrouped