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
Ordering
- Alphabetic
- By Inheritance
Inherited
- Context
- Serializable
- Serializable
- Product
- Equals
- AnyRef
- Any
Implicitly
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
&(g: Graph[N, A, B]): Graph[N, A, B]
Alias for
embed
- def +(other: String): String
- def ->[B](y: B): (Context[N, A, B], B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addPred(n: N, edge: B): Context[N, A, B]
Insert a predecessor after the focused node
-
def
addSucc(n: N, edge: B): Context[N, A, B]
Insert a successor after the focused node
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
embed(g: Graph[N, A, B]): Graph[N, A, B]
Embed this context in the given graph
- def ensuring(cond: (Context[N, A, B]) ⇒ Boolean, msg: ⇒ Any): Context[N, A, B]
- def ensuring(cond: (Context[N, A, B]) ⇒ Boolean): Context[N, A, B]
- def ensuring(cond: Boolean, msg: ⇒ Any): Context[N, A, B]
- def ensuring(cond: Boolean): Context[N, A, B]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- val inAdj: Adj[N, B]
-
def
inEdges: Vector[LEdge[N, B]]
Labeled edges into the focused node, including identity arrows to self
-
def
ins: Adj[N, B]
Adjacency list for all the incoming edges plus identity arrows to self
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- val label: A
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
neighbors: Vector[N]
All neighbors of the node
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- val outAdj: Adj[N, B]
-
def
outEdges: Vector[LEdge[N, B]]
Labeled edges from the focused node, including identity arrows from self
-
def
outs: Adj[N, B]
Adjacency list for all the outgoing edges plus identity arrows from self
-
def
predecessors: Vector[N]
All the sources of incoming edges
-
def
successors: Vector[N]
All the targets of outgoing edges
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- def toGrContext: GrContext[N, A, B]
- val vertex: N
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def →[B](y: B): (Context[N, A, B], B)