case class Graph[V](vertices: Set[V], edges: List[(V, V)]) extends Product with Serializable
A directed graph, allowing multi-edges and loops.
Two vertex objects are considered indistinguishable if they compare the same via .equals().
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Graph
- Serializable
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new Graph(vertices: Set[V], edges: List[(V, V)])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
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
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
- val edges: List[(V, V)]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(obj: Any): Boolean
- Definition Classes
- Graph → Equals → AnyRef → Any
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- lazy val hashCode: Int
- def inDegree(v: V): Int
- def inEdges(v: V): List[(V, V)]
- val inMap: Map[V, List[V]]
- def inVertices(v: V): List[V]
- def isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def map[U](f: (V) ⇒ U): Graph[U]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def outDegree(v: V): Int
- def outEdges(v: V): List[(V, V)]
- val outMap: Map[V, List[V]]
- def outVertices(v: V): List[V]
- def removeEdge(edge: (V, V)): Graph[V]
- def removeVertex(v: V): Graph[V]
- def sinks: List[V]
- def sources: List[V]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- Graph → AnyRef → Any
- val vertices: Set[V]
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )