final case class Graph[N, A, B](repr: Map[N, Context[N, A, B]]) extends Product with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Graph
- Serializable
- Serializable
- Product
- Equals
- AnyRef
- Any
- 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 &(c: Context[N, A, B]): Graph[N, A, B]
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def addEdge(e: Edge[N, B]): Graph[N, A, B]
- def addEdges(e1: Edge[N, B], e2: Edge[N, B], es: Edge[N, B]*): Graph[N, A, B]
- def addEdges(es: Iterable[Edge[N, B]]): Graph[N, A, B]
- def addNode(v: Node[N, A]): Graph[N, A, B]
- def addNodes(v1: Node[N, A], v2: Node[N, A], vs: Node[N, A]*): Graph[N, A, B]
- def addNodes(vs: Iterable[Node[N, A]]): Graph[N, A, B]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
- def contains(v: N): Boolean
- def context(v: N): Context[N, A, B]
- def contexts: Set[Context[N, A, B]]
-
def
decompose: GraphDecomposition[N, A, B]
- Annotations
- @silent()
- def decompose(v: N): Decomposition[N, A, B]
- def degree(v: N): Int
- def edge(e: (N, N)): Option[Edge[N, B]]
- def edges: Set[Edge[N, B]]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
extend[C](f: (GraphDecomposition[N, A, B]) ⇒ C): Graph[N, C, B]
- Annotations
- @silent()
- def filterEdges(p: (Edge[N, B]) ⇒ Boolean): Graph[N, A, B]
- def filterNodes(p: (Node[N, A]) ⇒ Boolean): Graph[N, A, B]
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
fold[C](z: C)(op: (Context[N, A, B], C) ⇒ C): C
- Annotations
- @silent()
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def inDegree(v: N): Int
- def inEdges(v: N): Set[Edge[N, B]]
- def isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def map[C, D](f: (Context[N, A, B]) ⇒ Context[N, C, D]): Graph[N, C, D]
- def mapEdges[C](f: (B) ⇒ C): Graph[N, A, C]
- def mapNodes[C](f: (A) ⇒ C): Graph[N, C, B]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def neighbors(v: N): Set[N]
- def node(v: N): Option[Node[N, A]]
- def nodes: Set[Node[N, A]]
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def order: Int
- def outDegree(v: N): Int
- def outEdges(v: N): Set[Edge[N, B]]
- def predecessors(v: N): Set[N]
- def removeEdge(e: (N, N)): Graph[N, A, B]
- def removeEdges(e1: (N, N), e2: (N, N), es: (N, N)*): Graph[N, A, B]
- def removeEdges(es: Iterable[(N, N)]): Graph[N, A, B]
- def removeNode(v: N): Graph[N, A, B]
- def removeNodes(v1: N, v2: N, vs: N*): Graph[N, A, B]
- def removeNodes(vs: Iterable[N]): Graph[N, A, B]
- val repr: Map[N, Context[N, A, B]]
- def reverse: Graph[N, A, B]
- def size: Int
- def successors(v: N): Set[N]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- Graph → AnyRef → Any
- def undirected: Graph[N, A, B]
- def union(that: Graph[N, A, B]): Graph[N, A, B]
- def unlabel: Graph[N, Unit, Unit]
- def updateEdge(e: Edge[N, B]): Graph[N, A, B]
- def updateEdges(es: Iterable[Edge[N, B]]): Graph[N, A, B]
- def updateNode(v: Node[N, A]): Graph[N, A, B]
- def updateNodes(vs: Iterable[Node[N, A]]): Graph[N, A, B]
-
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( ... ) @native()