trait Graph[E, N] extends AnyRef
A representation of a Graph.
A graph represents a relationship between objects (often called nodes). The relation between two objects is established by an "arrow" (called edge) between two nodes. This arrow has a direction, thereby creating incoming (pointing to a node) and outgoing edges for a node.
A graph is parametrized by:
- E
the value type of the edges
- N
the values type of the nodes
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Graph
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Abstract Value Members
- abstract def edgeId: Identifiable[E]
- abstract def edgeIds: Iterable[String]
- abstract def edges: Iterable[Edge[E]]
- abstract def findEdge(id: String): Option[Edge[E]]
- abstract def findNode(id: String): Option[Node[N]]
- abstract def incoming(nodeId: String): Iterable[Edge[E]]
- abstract def nodeId: Identifiable[N]
- abstract def nodeIds: Iterable[String]
- abstract def nodes: Iterable[Node[N]]
- abstract def outgoing(nodeId: String): Iterable[Edge[E]]
- abstract def removeEdgeById(edgeId: String): Graph[E, N]
- abstract def removeNodeById(nodeId: String): Graph[E, N]
- abstract def updateEdge(id: String)(f: (E) => E): Graph[E, N]
- abstract def updateNode(id: String)(f: (N) => N): Graph[E, N]
- abstract def withEdge(edge: Edge[E]): Graph[E, N]
- abstract def withNode(node: Node[N]): Graph[E, N]
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def addEdge(value: E, from: N, to: N): Graph[E, N]
- def addNode(nodeValue: N): Graph[E, N]
- def addNodes(nodeValues: Iterable[N]): Graph[E, N]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def predecessors(nodeId: String): Iterable[Node[N]]
- def removeEdge(edge: Edge[E]): Graph[E, N]
- def removeNode(node: Node[N]): Graph[E, N]
- def removeNodeValue(node: N): Graph[E, N]
- def successors(nodeId: String): Iterable[Node[N]]
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def withEdgeValue(value: E, fromId: String, toId: String): Graph[E, N]
- def withEdges(edges: Iterable[Edge[E]]): Graph[E, N]
- def withNodes(nodes: Iterable[Node[N]]): Graph[E, N]