Graph

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
@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
@HotSpotIntrinsicCandidate()
lazy val hashCode: Int

Definition Classes
Graph → AnyRef → Any
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
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@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
@throws( ... )
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Docs: object Graph | package graph

case class Graph[V](vertices: Set[V], edges: List[(V, V)]) extends Product with Serializable

Instance Constructors

new Graph(vertices: Set[V], edges: List[(V, V)])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

val edges: List[(V, V)]

final def eq(arg0: AnyRef): Boolean

def equals(obj: Any): Boolean

final def getClass(): Class[_]

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

def map[U](f: (V) ⇒ U): Graph[U]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

val vertices: Set[V]

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

Deprecated Value Members

def finalize(): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped