Class

quiver

Context

Related Doc: package quiver

Permalink

case class Context[N, A, B](inAdj: Adj[N, B], vertex: N, label: A, outAdj: Adj[N, B]) extends Product with Serializable

The view of a graph focused on the context surrounding a particular node.

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Context
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Context(inAdj: Adj[N, B], vertex: N, label: A, outAdj: Adj[N, B])

    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 addPred(n: N, edge: B): Context[N, A, B]

    Permalink

    Insert a predecessor after the focused node

  5. def addSucc(n: N, edge: B): Context[N, A, B]

    Permalink

    Insert a successor after the focused node

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  11. val inAdj: Adj[N, B]

    Permalink
  12. def inEdges: Vector[LEdge[N, B]]

    Permalink

    Labeled edges into the focused node, including identity arrows to self

  13. def ins: Adj[N, B]

    Permalink

    Adjacency list for all the incoming edges plus identity arrows to self

  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  15. val label: A

    Permalink
  16. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  17. def neighbors: Vector[N]

    Permalink

    All neighbors of the node

  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. val outAdj: Adj[N, B]

    Permalink
  21. def outEdges: Vector[LEdge[N, B]]

    Permalink

    Labeled edges from the focused node, including identity arrows from self

  22. def outs: Adj[N, B]

    Permalink

    Adjacency list for all the outgoing edges plus identity arrows from self

  23. def predecessors: Vector[N]

    Permalink

    All the sources of incoming edges

  24. def successors: Vector[N]

    Permalink

    All the targets of outgoing edges

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

    Permalink
    Definition Classes
    AnyRef
  26. def toGrContext: GrContext[N, A, B]

    Permalink
  27. val vertex: N

    Permalink
  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 Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped