Trait

razie.g

GraphLike

Related Doc: package g

Permalink

trait GraphLike[N <: GNode[N, L], L <: GLink[N]] extends AnyRef

this is a filtered graph - a subgraph, see Graphs.colored

Linear Supertypes
AnyRef, Any
Known Subclasses
CGL, DepthGraphLike, IndexedGraphLike, NoCyclesGraphLike
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphLike
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def colored: (N) ⇒ Boolean

    Permalink

  2. abstract def root: N

    Permalink

Concrete 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 dag: NoCyclesGraphLike[N, L]

    Permalink

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

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink

  11. def finalize(): Unit

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

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

    Permalink

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

    Permalink

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

    Permalink
    Definition Classes
    AnyRef → Any

  15. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Attributes
    protected

  17. def indexed: IndexedGraphLike[N, L]

    Permalink

  18. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  19. def mkString: String

    Permalink

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

  20. def mkString2: String

    Permalink

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

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

    Permalink
    Definition Classes
    AnyRef

  22. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  23. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Attributes
    protected

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

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  27. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  28. final def wait(): Unit

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped