trait
UndirectedGraph[VP, EP] extends AnyRef
Type Members
-
abstract
type
ES
-
abstract
type
G[VP, EP] <: UndirectedGraph[VP, EP]
Abstract Value Members
-
abstract
def
allEdges(): Set[Edge[ES, EP]]
-
abstract
def
areNeighbors(v1: Vertex[VP], v2: Vertex[VP]): Boolean
-
abstract
def
degree(v: Vertex[VP]): Int
-
abstract
def
delete(v: Vertex[VP]): G[VP, EP]
-
abstract
def
edgeFunction(): (Seq[Vertex[VP]]) ⇒ Seq[(Vertex[VP], Vertex[VP], EP)]
-
abstract
def
edgesTouching(v: Vertex[VP]): Set[Edge[ES, EP]]
-
abstract
def
eliminate(v: Vertex[VP], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): G[VP, EP]
-
abstract
def
findVertex(f: (Vertex[VP]) ⇒ Boolean): Option[Vertex[VP]]
-
abstract
def
firstLeafOtherThan(r: Vertex[VP]): Option[Vertex[VP]]
-
abstract
def
forceClique(vs: Set[Vertex[VP]], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): G[VP, EP]
-
abstract
def
map[NVP, NEP](vpf: (VP) ⇒ NVP, epf: (EP) ⇒ NEP)(implicit arg0: Manifest[NVP]): G[NVP, NEP]
-
abstract
def
neighbors(v: Vertex[VP]): Set[Vertex[VP]]
-
abstract
def
unlink(v1: Vertex[VP], v2: Vertex[VP]): G[VP, EP]
-
abstract
def
unlink(e: Edge[ES, EP]): G[VP, EP]
-
abstract
def
vertexPayloads(): Seq[VP]
-
abstract
def
vertices(edge: Edge[ES, EP]): (Vertex[VP], Vertex[VP])
-
abstract
def
vertices(): Set[Vertex[VP]]
Concrete Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
connects(edge: Edge[ES, EP], a1: Vertex[VP], a2: Vertex[VP]): Boolean
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
isClique(vs: GenTraversable[Vertex[VP]]): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
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]
-
final
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]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any