Class/Object

swave.core.graph

Digraph

Related Docs: object Digraph | package graph

Permalink

final class Digraph[V] extends AnyRef

A very basic model for a Directed Graph, providing only what is required for rendering (prepation), not general graph manipulation or analysis.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Digraph
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Digraph(graphData: GraphData[V])

    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. def addVertexAttributes(bitSet: BitSet, attr: AnyRef): Unit

    Permalink

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. def attributes(vertex: V): List[AnyRef]

    Permalink

  7. def clone(): AnyRef

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

  8. def discoverRegion(entries: Seq[V], exits: Seq[V]): BitSet

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  15. def isMarked(vertex: V, bitSet: BitSet): Boolean

    Permalink

  16. def markHidden(predicate: (V) ⇒ Boolean): Unit

    Permalink

  17. def markPaths(origin: V, target: V, attrs: EdgeAttributes): Unit

    Permalink

    Apply the given attributes to all edges of all paths leading from the origin vertex to the target vertex.

    Apply the given attributes to all edges of all paths leading from the origin vertex to the target vertex. If there is no path from origin to target or origin and target are the same vertex then this method has no effect.

  18. def migrateVertexSet(otherGraph: Digraph[_], bitSet: BitSet): BitSet

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  20. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  21. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  22. def render(glyphSet: GlyphSet = GlyphSet.`3x3 ASCII`): Rendering[V]

    Permalink

    Renders the graph into a Digraph.Rendering instance using the given GlyphSet.

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

    Permalink
    Definition Classes
    AnyRef

  24. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  25. def vertices: Vector[V]

    Permalink

    The set of (distinct) vertices of the graph.

  26. final def wait(): Unit

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

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

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

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

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

  29. def xRankOrdering: Ordering[V]

    Permalink

Inherited from AnyRef

Inherited from Any

Ungrouped