trait
UndirectedGraph[UG, V, E] extends AnyRef
Abstract Value Members
-
abstract
def
areNeighbors(jug: UG, v1: V, v2: V)(implicit eqV: Eq[V]): Boolean
-
abstract
def
connects(jug: UG, edge: E, a1: V, a2: V)(implicit eqV: Eq[V]): Boolean
-
abstract
def
degree(jug: UG, v: V): Int
-
abstract
def
edges(jug: UG): Iterable[E]
-
abstract
def
edgesTouching(jug: UG, v: V): Iterable[E]
-
abstract
def
eliminate(jug: UG, v: V, payload: (V, V) ⇒ E): UG
-
abstract
def
filterEdges(jug: UG, f: (E) ⇒ Boolean): UG
-
abstract
def
findVertex(jug: UG, f: (V) ⇒ Boolean): Option[V]
-
abstract
def
firstLeafOtherThan(jug: UG, r: V)(implicit eqV: Eq[V]): Option[V]
-
abstract
def
forceClique(jug: UG, among: Set[V], payload: (V, V) ⇒ E)(implicit eqV: Eq[V], mv: Manifest[V]): UG
-
abstract
def
isClique(jug: UG, vs: Iterable[V])(implicit eqV: Eq[V]): Boolean
-
abstract
def
make(vps: Seq[V], ef: Seq[(V, V, E)]): UG
-
abstract
def
neighbors(jug: UG, v: V): Iterable[V]
-
abstract
def
other(jug: UG, edge: E, u: V)(implicit eqV: Eq[V]): V
-
abstract
def
vertices(jusg: UG, e: E): (V, V)
-
abstract
def
vertices(jug: UG): Iterable[V]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit