case class UnDiEdge[T <: Node[_]](left: T, right: T) extends Edge[T] with ProtoEdge[T] with Product with Serializable
Represents an undirected edge.
- T
The type of the vertices.
- left
Left vertex of the edge.
- right
Right vertex of the edge.
- Alphabetic
- By Inheritance
- UnDiEdge
- Serializable
- Product
- Equals
- Edge
- ProtoEdge
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new UnDiEdge(left: T, right: T)
- left
Left vertex of the edge.
- right
Right vertex of the edge.
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
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def canEqual(that: Any): Boolean
Checks if this instance can equal that instance.
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- def contains(vertex: T): Boolean
Checks if the edge contains the given vertex.
Checks if the edge contains the given vertex.
- vertex
The vertex to check.
- returns
truefalse
- Definition Classes
- Edge
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
Checks if this equals that.
Checks if this equals that.
Undirected edges (x,y) equal (y,x). This equals function tests equivalence respecting this property.
- that
The object to test equivalence to.
- returns
true
- Definition Classes
- UnDiEdge → Equals → AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def getNeighborOf(vertex: T): Option[T]
Get the neighboring vertex of the base vertex.
Get the neighboring vertex of the base vertex.
Uses scala.Option as the return type for compatibility with edges that may not have a neighbor.
- vertex
The base vertex.
- returns
The neighbor of vertex, wrapped in
Some(.)
- Definition Classes
- Edge
- def hashCode(): Int
Calculates the hash code of the edge.
Calculates the hash code of the edge.
- returns
Hash code of the edge.
- Definition Classes
- UnDiEdge → AnyRef → Any
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- val left: T
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def productIterator: Iterator[Any]
- Definition Classes
- Product
- val right: T
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- 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])
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])