trait MutableEdgeData[V, E] extends EdgeData[V, E]
Mixing this trait into a DiGraph indicates that each edge may be associated with an optional data value. The MutableEdgeData trait provides an API for viewing and mutating edge data.
- V
the vertex type (datatype) of the underlying DiGraph
- E
the type of each edge data value
- Self Type
- MutableEdgeData[V, E] with MutableDiGraph[V]
- Source
- EdgeData.scala
- Alphabetic
- By Inheritance
- MutableEdgeData
- EdgeData
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
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(u: V, v: V, data: E): Unit
Add an edge (u,v) to the graph with associated edge data.
Add an edge (u,v) to the graph with associated edge data.
- u
the source of the edge
- v
the destination of the edge
- data
the edge data to associate with the edge
- Exceptions thrown
scala.IllegalArgumentException
if u or v is not part of the graph- See also
-
def
addEdgeIfValid(u: V, v: V, data: E): Boolean
Safely add an edge (u,v) to the graph with associated edge data if and only if both vertices are present in the graph.
Safely add an edge (u,v) to the graph with associated edge data if and only if both vertices are present in the graph. This is useful for preventing spurious edge creating when examining a subset of possible nodes.
- u
the source of the edge
- v
the destination of the edge
- data
the edge data to associate with the edge
- returns
a Boolean indicating whether the edge was added
- See also
-
def
addPairWithEdge(u: V, v: V, data: E): Unit
Safely add an edge (u,v) to the graph with associated edge data.
Safely add an edge (u,v) to the graph with associated edge data. If on or more of the two vertices is not present in the graph, add them before creating the edge.
- u
the source of the edge
- v
the destination of the edge
- data
the edge data to associate with the edge
- See also
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
assertEdgeExists(u: V, v: V): Unit
- Attributes
- protected
- Definition Classes
- EdgeData
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @HotSpotIntrinsicCandidate()
-
def
edgeData(u: V, v: V): E
- u
the source of the edge
- v
the destination of the edge
- returns
the edge data associated with a given edge
- Definition Classes
- EdgeData
- Exceptions thrown
EdgeNotFoundException
if the edge does not existscala.NoSuchElementException
if the edge has no data
-
val
edgeDataMap: Map[(V, V), E]
- Attributes
- protected
- Definition Classes
- MutableEdgeData → EdgeData
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
getEdgeData(u: V, v: V): Option[E]
Optionally return the edge data associated with a given edge.
Optionally return the edge data associated with a given edge.
- u
the source of the edge
- v
the destination of the edge
- returns
an option containing the edge data, if any, or None
- Definition Classes
- EdgeData
-
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
setEdgeData(u: V, v: V, data: E): Unit
Associate an edge data value with a graph edge.
Associate an edge data value with a graph edge.
- u
the source of the edge
- v
the destination of the edge
- data
the edge data to associate with the edge
- Exceptions thrown
EdgeNotFoundException
if the edge does not exist in the graph
-
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( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
This is the documentation for Firrtl.