final
class
DirectedGraphOps[DG, V, E] extends AnyRef
Instance Constructors
-
new
DirectedGraphOps(dg: DG)(implicit ev: DirectedGraph[DG, V, E])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
areNeighbors(v1: V, v2: V)(implicit eqV: Eq[V]): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
connects(e: E, v1: V, v2: V)(implicit eqV: Eq[V]): Boolean
-
def
descendants(v: V): Set[V]
-
def
descendantsIntersectsSet(v: V, s: Set[V]): Boolean
-
def
destination(e: E): V
-
val
dg: DG
-
def
edges: Iterable[E]
-
def
edgesTouching(v: V): Set[E]
-
-
-
def
filterEdges(f: (E) ⇒ Boolean): DG
-
def
finalize(): Unit
-
def
findVertex(f: (V) ⇒ Boolean): Option[V]
-
def
forceClique(vs: Set[V], edgeFn: (V, V) ⇒ E)(implicit eqV: Eq[V], manV: Manifest[V]): DG
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
isClique(vs: Iterable[V])(implicit eqV: Eq[V]): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
leaves: Set[V]
-
-
def
neighbors(v: V): Set[V]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
other(e: E, v: V)(implicit eqV: Eq[V]): V
-
def
outputEdgesOf(v: V): Set[E]
-
def
precedes(v1: V, v2: V): Boolean
-
def
predecessors(v: V): Set[V]
-
def
removeInputs(vs: Set[V]): DG
-
def
removeOutputs(vs: Set[V]): DG
-
def
shortestPath(source: V, goal: V)(implicit eqV: Eq[V]): Option[List[E]]
-
def
source(e: E): V
-
def
successors(v: V): Set[V]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
vertices: Iterable[V]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit