WeightedGraphImpl

org.encalmo.data.Graph.WeightedGraphImpl
final class WeightedGraphImpl[N, V](val nodes: Traversable[N], val adjacent: N => Traversable[N], val weight: (N, N) => V)(implicit evidence$1: Numeric[V]) extends GenericGraph[N], Weighted[N, V]

Attributes

Graph
Supertypes
trait Weighted[N, V]
trait GenericGraph[N]
trait Graph[N]
class Object
trait Matchable
class Any
Show all

Members list

Value members

Concrete methods

override def hasAdjacent(node: N): Boolean

Attributes

Definition Classes

Inherited methods

override def contains(node: N): Boolean

Attributes

Definition Classes
Inherited from:
GenericGraph
override def edges: Traversable[(N, N)]

Attributes

Definition Classes
Inherited from:
GenericGraph
override def edgesCount: Long

Attributes

Definition Classes
Inherited from:
GenericGraph
override def nodesCount: Int

Attributes

Definition Classes
Inherited from:
GenericGraph
override def reverse: Graph[N]

Attributes

Definition Classes
Inherited from:
GenericGraph

Concrete fields

val adjacent: N => Traversable[N]
val nodes: Traversable[N]
val weight: (N, N) => V