net.walend.graph

IndexedLabelDigraph

trait IndexedLabelDigraph[Node, Label] extends LabelDigraph[Node, Label]

A digraph that exposes the indices of stored nodes.

Linear Supertypes
LabelDigraph[Node, Label], Digraph[Node], Graph[Node], AnyRef, Any
Known Subclasses
AdjacencyLabelDigraph, MatrixLabelDigraph
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. IndexedLabelDigraph
  2. LabelDigraph
  3. Digraph
  4. Graph
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. trait DigraphInnerNodeTrait extends InnerNodeTrait

    Definition Classes
    Digraph

  2. type InnerEdgeType = (InnerNodeType, InnerNodeType, Label)

    Definition Classes
    LabelDigraph → Graph

  3. trait InnerIndexedNodeTrait extends DigraphInnerNodeTrait

    An internal representation of nodes within the graph

  4. trait InnerNodeTrait extends AnyRef

    An internal representation of nodes within the graph

    An internal representation of nodes within the graph

    Definition Classes
    Graph

  5. abstract type InnerNodeType <: InnerIndexedNodeTrait

    The type of InnerNodeTrait for this digraph representation

    The type of InnerNodeTrait for this digraph representation

    Definition Classes
    IndexedLabelDigraph → Digraph → Graph

  6. type OuterEdgeType = (Node, Node, Label)

    Definition Classes
    LabelDigraph → Graph

Abstract Value Members

  1. abstract def edges: GenTraversable[OuterEdgeType]

    returns

    A Traversable (usually something more specific) of the edges

    Definition Classes
    Graph

  2. abstract def innerEdges: GenTraversable[InnerEdgeType]

    returns

    A Traversable of the edges as represented in the graph

    Definition Classes
    Graph

  3. abstract def innerNode(value: Node): Option[InnerNodeType]

    value

    a node that might be in this digraph

    returns

    Some inner node if it exists in the digraph or None

    Definition Classes
    Graph

  4. abstract def innerNodeForIndex(i: Int): InnerNodeType

  5. abstract def innerNodes: IndexedSet[InnerNodeType]

    returns

    internal representation of all of the nodes in the graph.

    Definition Classes
    IndexedLabelDigraph → Graph

  6. abstract def label(i: Int, j: Int): Label

  7. abstract def label(start: InnerNodeType, end: InnerNodeType): Label

    returns

    the Edge between start and end or noEdgeExistsValue if no edge connects start to end

    Definition Classes
    LabelDigraph

  8. abstract def noEdgeExistsLabel: Label

    returns

    the label to return when no edge exists

    Definition Classes
    LabelDigraph

  9. abstract def node(i: Int): Node

  10. abstract def nodeCount: Int

    returns

    number of nodes in the graph

    Definition Classes
    Graph

  11. abstract def nodes: IndexedSet[Node]

    All the nodes in the graph, in an indexed set

    All the nodes in the graph, in an indexed set

    Definition Classes
    IndexedLabelDigraph → Graph

  12. abstract def nodesSeq: IndexedSeq[Node]

    returns

    All the nodes in the graph in an indexed seq

    Annotations
    @deprecated
    Deprecated

    (Since version 0.1.1) replace with nodes

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  5. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  8. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  10. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  11. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  13. final def notify(): Unit

    Definition Classes
    AnyRef

  14. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  16. def toString(): String

    Definition Classes
    AnyRef → Any

  17. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from LabelDigraph[Node, Label]

Inherited from Digraph[Node]

Inherited from Graph[Node]

Inherited from AnyRef

Inherited from Any

Ungrouped