Trait

net.walend.disentangle.graph

Graph

Related Doc: package graph

Permalink

trait Graph[Node] extends AnyRef

Ancestor trait for a variety of Graphs.

A graph with Nodes that can be distinguished from each other. An InnerNodeType provides access to a nodes place in the graph.

I've pulled definitions from Wikipedia: http://en.wikipedia.org/wiki/Graph_(mathematics) where possible

Since

v0.1.0

Linear Supertypes
AnyRef, Any
Known Subclasses
AdjacencyDigraph, AdjacencyLabelDigraph, AdjacencyLabelUndigraph, AdjacencyUndigraph, Digraph, IndexedGraph, IndexedLabelDigraph, IndexedLabelUndigraph, IndexedUndigraph, LabelDigraph, LabelUndigraph, MatrixLabelDigraph, MutableLabelDigraph, Tuple2Digraph, Undigraph
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Graph
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. abstract type InnerEdgeType

    Permalink

  2. trait InnerNodeTrait extends AnyRef

    Permalink

    An internal representation of nodes within the graph

  3. abstract type InnerNodeType <: InnerNodeTrait

    Permalink

    The type of InnerNodeTrait for this digraph representation

  4. abstract type OuterEdgeType

    Permalink

Abstract Value Members

  1. abstract def edges: GenTraversable[OuterEdgeType]

    Permalink

    returns

    A Traversable (usually something more specific) of the edges

  2. abstract def innerEdges: GenTraversable[InnerEdgeType]

    Permalink

    returns

    A Traversable of the edges as represented in the graph

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

    Permalink

    value

    a node that might be in this digraph

    returns

    Some inner node if it exists in the digraph or None

  4. abstract def innerNodes: GenSet[InnerNodeType]

    Permalink

    returns

    InnerNode representation of all of the nodes in the graph.

  5. abstract def nodeCount: Int

    Permalink

    returns

    number of nodes in the graph

  6. abstract def nodes: GenSet[Node]

    Permalink

    All the nodes in the graph

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. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  8. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  11. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  13. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  14. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  16. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  17. final def wait(): Unit

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped