trait
DirectedGraph[DG, V, E] extends AnyRef
Abstract Value Members
-
abstract
def
areNeighbors(jdg: DG, v1: V, v2: V)(implicit eqV: Eq[V]): Boolean
-
abstract
def
connects(jdg: DG, edge: E, a1: V, a2: V)(implicit eqV: Eq[V]): Boolean
-
abstract
def
degree(jdg: DG, v: V): Int
-
abstract
def
descendantsIntersectsSet(jdg: DG, v: V, s: Set[V]): Boolean
-
abstract
def
destination(jdg: DG, e: E): V
-
abstract
def
edges(jdg: DG): Iterable[E]
-
abstract
def
edgesTouching(jdg: DG, v: V): Set[E]
-
abstract
def
eliminate(jdg: DG, v: V, payload: (V, V) ⇒ E): DG
-
abstract
def
filterEdges(jdg: DG, f: (E) ⇒ Boolean): DG
-
abstract
def
findVertex(jdg: DG, f: (V) ⇒ Boolean): Option[V]
-
abstract
def
firstLeafOtherThan(jdg: DG, r: V)(implicit eqV: Eq[V]): Option[V]
-
abstract
def
forceClique(jdg: DG, among: Set[V], payload: (V, V) ⇒ E)(implicit eqV: Eq[V], mV: Manifest[V]): DG
-
abstract
def
isClique(jdg: DG, vs: Iterable[V])(implicit eqV: Eq[V]): Boolean
-
abstract
def
isLeaf(jdg: DG, v: V): Boolean
-
abstract
def
leaves(jdg: DG): Set[V]
-
abstract
def
make(Vs: Seq[V], ef: Seq[(V, V, E)]): DG
-
abstract
def
neighbors(jdg: DG, v: V): Set[V]
-
abstract
def
other(jdg: DG, edge: E, u: V)(implicit eqV: Eq[V]): V
-
abstract
def
outputEdgesOf(jdg: DG, v: V): Set[E]
-
abstract
def
precedes(jdg: DG, v1: V, v2: V): Boolean
-
abstract
def
predecessors(jdg: DG, v: V): Set[V]
-
abstract
def
removeInputs(jdg: DG, to: Set[V]): DG
-
abstract
def
removeOutputs(jdg: DG, from: Set[V]): DG
-
abstract
def
shortestPath(jdg: DG, source: V, goal: V)(implicit eqV: Eq[V]): Option[List[E]]
-
abstract
def
source(jdg: DG, e: E): V
-
abstract
def
successors(jdg: DG, v: V): Set[V]
-
abstract
def
vertices(jdg: DG): Iterable[V]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
_descendants(jdg: DG, v: V, accumulator: Set[V]): Set[V]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
descendants(jdg: DG, v: V): Set[V]
-
-
-
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