case class DirectedGraphData[V, +VD, +ED](vertices: Set[V], edges: Set[Edge[V]], vertexData: Map[V, VD], edgeData: Map[Edge[V], ED]) extends DirectedGraphLike[V] with Product with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- DirectedGraphData
- Serializable
- Serializable
- Product
- Equals
- DirectedGraphLike
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
Type Members
-
type
E = Edge[V]
- Definition Classes
- DirectedGraphLike
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(e: E): DirectedGraphData[V, VD, ED]
- def +(v: V): DirectedGraphData[V, VD, ED]
- def ++[VD1 >: VD, ED1 >: ED](that: DirectedGraphData[V, VD1, ED1]): DirectedGraphData[V, VD1, ED1]
- def -(e: E): DirectedGraphData[V, VD, ED]
- def -(v: V): DirectedGraphData[V, VD, ED]
- def --(vs: Iterable[V]): DirectedGraphData[V, VD, ED]
- def --[ED1, VD1](subGraph: DirectedGraphData[V, ED1, VD1]): DirectedGraphData[V, VD, ED]
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def collectData[VD1, ED1](vp: PartialFunction[VD, VD1], ep: PartialFunction[ED, ED1]): Nothing
-
def
connectedComponents(continue: (V) ⇒ Iterable[V]): Seq[Seq[V]]
- Definition Classes
- DirectedGraphLike
-
def
connectedComponents: Seq[Seq[V]]
- Definition Classes
- DirectedGraphLike
-
def
degree(v: V): Int
- Definition Classes
- DirectedGraphLike
-
def
depthFirstSearch(start: V, continue: (V) ⇒ Iterable[V] = successors): Iterator[V] { ... /* 3 definitions in type refinement */ }
- Definition Classes
- DirectedGraphLike
- val edgeData: Map[Edge[V], ED]
-
val
edges: Set[Edge[V]]
- Definition Classes
- DirectedGraphData → DirectedGraphLike
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
filter(vp: (V) ⇒ Boolean): DirectedGraph[V]
- Definition Classes
- DirectedGraphLike
- def filterEdges(ep: (E) ⇒ Boolean): DirectedGraphData[V, VD, ED]
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hasCycle: Boolean
- Definition Classes
- DirectedGraphLike
-
def
inDegree(v: V): Int
- Definition Classes
- DirectedGraphLike
-
def
incidentEdges(vp: (V) ⇒ Boolean): Set[E]
- Definition Classes
- DirectedGraphLike
-
def
incidentEdges(v: V): Set[E]
- Definition Classes
- DirectedGraphLike
-
lazy val
incomingEdges: Map[V, Set[E]]
- Definition Classes
- DirectedGraphLike
-
def
inducedEdges(vp: (V) ⇒ Boolean): Set[E]
- Definition Classes
- DirectedGraphLike
-
def
inducedSubGraph(vp: (V) ⇒ Boolean): DirectedGraph[V]
- Definition Classes
- DirectedGraphLike
- def inducedSubGraphData(vp: (V) ⇒ Boolean): DirectedGraphData[V, VD, ED]
-
def
isComplete: Boolean
- Definition Classes
- DirectedGraphLike
-
def
isConnected: Boolean
- Definition Classes
- DirectedGraphLike
-
def
isEmpty: Boolean
- Definition Classes
- DirectedGraphLike
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isIsomorphicTo(that: DirectedGraphLike[V]): Boolean
- Definition Classes
- DirectedGraphLike
-
def
isPlanar: Boolean
- Definition Classes
- DirectedGraphLike
-
def
isolatedVertices: Set[V]
- Definition Classes
- DirectedGraphLike
-
def
m: Int
- Definition Classes
- DirectedGraphLike
- def mapData[VD1, ED1](v: (VD) ⇒ VD1 = identity, e: (ED) ⇒ ED1 = identity): DirectedGraphData[V, VD1, ED1]
- def mapVertices(m: (V) ⇒ V): DirectedGraphData[V, VD, ED]
-
def
n: Int
- Definition Classes
- DirectedGraphLike
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
neighbours(vp: (V) ⇒ Boolean): Set[V]
- Definition Classes
- DirectedGraphLike
-
lazy val
neighbours: Map[V, Set[V]]
- Definition Classes
- DirectedGraphLike
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
numElements: Int
- Definition Classes
- DirectedGraphLike
-
def
outDegree(v: V): Int
- Definition Classes
- DirectedGraphLike
-
lazy val
outgoingEdges: Map[V, Set[E]]
- Definition Classes
- DirectedGraphLike
-
lazy val
predecessors: Map[V, Set[V]]
- Definition Classes
- DirectedGraphLike
-
def
reachable(a: V, b: V): Boolean
- Definition Classes
- DirectedGraphLike
- def removeEdges(es: Iterable[E]): DirectedGraphData[V, VD, ED]
-
def
stronglyConnectedComponents: Seq[Seq[V]]
- Definition Classes
- DirectedGraphLike
-
def
subGraphOf(superGraph: DirectedGraphLike[V]): Boolean
- Definition Classes
- DirectedGraphLike
-
lazy val
successors: Map[V, Set[V]]
- Definition Classes
- DirectedGraphLike
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- DirectedGraphData → AnyRef → Any
-
def
topologicalSort: List[V]
- Definition Classes
- DirectedGraphLike
- val vertexData: Map[V, VD]
-
val
vertices: Set[V]
- Definition Classes
- DirectedGraphData → DirectedGraphLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )