class Graph[N, A, C] extends AnyRef
Represents a graph where nodes are elements of N, and edges are annotated with elements of type-class GraphAnnotation
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Graph
- AnyRef
- Any
Implicitly
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new Graph(ids: Map[N, Int], next: Int, nodes: Set[N], edges: Map[N, Set[(A, N)]])(implicit g: GraphNode[N, C], a: GraphAnnotation[A, C])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (Graph[N, A, C], B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- implicit val a: GraphAnnotation[A, C]
-
def
addEdge(node1: N, annot: A, node2: N): Graph[N, A, C]
Add an edge frome node1 to node2, with annotation annot
-
def
addEdges(l: Traversable[(N, A, N)]): Graph[N, A, C]
Add multiple edges
-
def
addNode(node: N): Graph[N, A, C]
Add a node to the graph
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
- val edges: Map[N, Set[(A, N)]]
- def ensuring(cond: (Graph[N, A, C]) ⇒ Boolean, msg: ⇒ Any): Graph[N, A, C]
- def ensuring(cond: (Graph[N, A, C]) ⇒ Boolean): Graph[N, A, C]
- def ensuring(cond: Boolean, msg: ⇒ Any): Graph[N, A, C]
- def ensuring(cond: Boolean): Graph[N, A, C]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def formatted(fmtstr: String): String
- implicit val g: GraphNode[N, C]
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
getNode(id: Int): Option[N]
Get the node with the given id, mostly used for debugging purposes
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- val ids: Map[N, Int]
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- val next: Int
-
def
nodeId(node: N): Int
Get the id of the given node, mostly used for debugging purposes
- val nodes: Set[N]
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
removeNode(node: N): Graph[N, A, C]
Remove a node from the graph
-
def
size: Int
Number of nodes in the graph
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
transitions: Int
Number of edges in the graph
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def →[B](y: B): (Graph[N, A, C], B)