trait
DirectedGraph
[VP, EP]
extends AnyRef
Abstract Value Members
-
def
allEdges
(): Set[Edge[ES, EP]]
-
def
deleteVertex
(v: Vertex[VP]): G[VP, EP]
-
def
descendantsIntersectsSet
(v: Vertex[VP], s: Set[Vertex[VP]]): Boolean
-
def
dest
(edge: Edge[ES, EP]): Vertex[VP]
-
def
findEdge
(from: Vertex[VP], to: Vertex[VP]): Option[Edge[ES, EP]]
-
def
findVertex
(f: (Vertex[VP]) ⇒ Boolean): Option[Vertex[VP]]
-
def
isAcyclic
(): Boolean
-
def
isLeaf
(v: Vertex[VP]): Boolean
-
def
leaves
(): Set[Vertex[VP]]
-
def
neighbors
(v: Vertex[VP]): Set[Vertex[VP]]
-
def
outputEdgesOf
(v: Vertex[VP]): Set[Edge[ES, EP]]
-
def
precedes
(v1: Vertex[VP], v2: Vertex[VP]): Boolean
-
def
predecessors
(v: Vertex[VP]): Set[Vertex[VP]]
-
def
shortestPath
(source: Vertex[VP], goal: Vertex[VP]): Option[List[Edge[ES, EP]]]
-
def
size
(): Int
-
def
source
(edge: Edge[ES, EP]): Vertex[VP]
-
def
successors
(v: Vertex[VP]): Set[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
_ancestors
(v: Vertex[VP], result: Set[Vertex[VP]]): Unit
-
def
_descendants
(v: Vertex[VP], result: Set[Vertex[VP]]): Unit
-
def
ancestors
(vs: Set[Vertex[VP]]): Set[Vertex[VP]]
-
def
ancestors
(v: Vertex[VP]): Set[Vertex[VP]]
-
def
asInstanceOf
[T0]
: T0
-
def
clone
(): AnyRef
-
def
descendants
(v: Vertex[VP]): Set[Vertex[VP]]
-
def
eq
(arg0: AnyRef): Boolean
-
def
equals
(arg0: Any): Boolean
-
def
finalize
(): Unit
-
def
getClass
(): java.lang.Class[_]
-
def
hashCode
(): Int
-
def
isInstanceOf
[T0]
: Boolean
-
def
ne
(arg0: AnyRef): Boolean
-
def
notify
(): Unit
-
def
notifyAll
(): Unit
-
def
synchronized
[T0]
(arg0: ⇒ T0): T0
-
def
toString
(): String
-
def
wait
(): Unit
-
def
wait
(arg0: Long, arg1: Int): Unit
-
def
wait
(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any