Class

es.weso.rbe

GraphMap

Related Doc: package rbe

Permalink

case class GraphMap[Edge, Node](m: Map[Node, Seq[(Edge, Node)]]) extends Graph[Edge, Node] with Product with Serializable

Implementation of graph as a map

Source
Graph.scala
Linear Supertypes
Serializable, Serializable, Product, Equals, Graph[Edge, Node], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphMap
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Graph
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GraphMap(m: Map[Node, Seq[(Edge, Node)]])

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

    Permalink
    Definition Classes
    AnyRef

  7. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  9. def in: (Node) ⇒ Pairs

    Permalink

    input edges and referenced nodes from a node

    input edges and referenced nodes from a node

    Definition Classes
    GraphMap → Graph

  10. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  11. val m: Map[Node, Seq[(Edge, Node)]]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  13. def nodes: Seq[Node]

    Permalink

    List of nodes

    List of nodes

    Definition Classes
    GraphMap → Graph

  14. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  15. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  16. def out: (Node) ⇒ Seq[(Edge, Node)]

    Permalink

    output edges and referenced nodes from a node

    output edges and referenced nodes from a node

    Definition Classes
    GraphMap → Graph

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

    Permalink
    Definition Classes
    AnyRef

  18. def triples: Seq[(Node, Edge, Node)]

    Permalink

    sequence of triples in a graph

    sequence of triples in a graph

    Definition Classes
    GraphMap → Graph

  19. final def wait(): Unit

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

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

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

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Graph[Edge, Node]

Inherited from AnyRef

Inherited from Any

Ungrouped