trait
UndirectedGraph
[VP, EP]
extends AnyRef
Abstract Value Members
-
def
allEdges
(): Set[Edge[ES, EP]]
-
def
areNeighbors
(v1: Vertex[VP], v2: Vertex[VP]): Boolean
-
def
degree
(v: Vertex[VP]): Int
-
def
delete
(v: Vertex[VP]): G[VP, EP]
-
def
edgesTouching
(v: Vertex[VP]): Set[Edge[ES, EP]]
-
def
eliminate
(v: Vertex[VP], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): G[VP, EP]
-
def
findVertex
(f: (Vertex[VP]) ⇒ Boolean): Option[Vertex[VP]]
-
def
firstLeafOtherThan
(r: Vertex[VP]): Option[Vertex[VP]]
-
def
forceClique
(vs: Set[Vertex[VP]], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): G[VP, EP]
-
def
neighbors
(v: Vertex[VP]): Set[Vertex[VP]]
-
def
unlink
(v1: Vertex[VP], v2: Vertex[VP]): G[VP, EP]
-
def
unlink
(e: Edge[ES, EP]): G[VP, EP]
-
def
vertices
(edge: Edge[ES, EP]): (Vertex[VP], Vertex[VP])
-
def
vertices
(): Set[Vertex[VP]]
Concrete Value Members
-
def
!=
(arg0: AnyRef): Boolean
-
def
!=
(arg0: Any): Boolean
-
def
##
(): Int
-
def
==
(arg0: AnyRef): Boolean
-
def
==
(arg0: Any): Boolean
-
def
asInstanceOf
[T0]
: T0
-
def
clone
(): AnyRef
-
def
connects
(edge: Edge[ES, EP], a1: Vertex[VP], a2: Vertex[VP]): Boolean
-
def
eq
(arg0: AnyRef): Boolean
-
def
equals
(arg0: Any): Boolean
-
def
finalize
(): Unit
-
def
getClass
(): java.lang.Class[_]
-
def
hashCode
(): Int
-
def
isClique
(vs: GenTraversable[Vertex[VP]]): Boolean
-
def
isInstanceOf
[T0]
: Boolean
-
def
ne
(arg0: AnyRef): Boolean
-
def
notify
(): Unit
-
def
notifyAll
(): Unit
-
def
numEdgesToForceClique
(vs: GenTraversable[Vertex[VP]], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): Int
-
def
other
(edge: Edge[ES, EP], u: Vertex[VP]): Vertex[VP]
-
def
synchronized
[T0]
(arg0: ⇒ T0): T0
-
def
toString
(): String
-
def
vertexWithFewestEdgesToEliminateAmong
(among: Set[Vertex[VP]], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): Vertex[VP]
-
def
vertexWithFewestNeighborsAmong
(among: Set[Vertex[VP]]): Vertex[VP]
-
def
wait
(): Unit
-
def
wait
(arg0: Long, arg1: Int): Unit
-
def
wait
(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any