Growable

scalax.collection.mutable.Growable
trait Growable[-N, -E <: Edge[N]]

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait AbstractBuilder[N, E]
trait GraphOps[N, E, CC]
trait GraphLike[N, E, CC]
trait AdjacencyListGraph[N, E, CC]
class DefaultGraphImpl[N, E]
trait Graph[N, E]
Show all

Members list

Value members

Abstract methods

protected def add(node: N): Boolean

Adds a single node to this graph.

Adds a single node to this graph.

Attributes

Returns

true if this graph has not contained node before.

protected def add(edge: E): Boolean

Adds a single edge to this graph.

Adds a single edge to this graph.

Attributes

Returns

true if this graph has not contained edge before.

Concrete methods

def ++=(xs: Iterable[OuterElem[N, E]]): this.type

Alias for addAll(xs).

Alias for addAll(xs).

Attributes

final def +=(node: N): this.type

Alias for addOne(node).

Alias for addOne(node).

Attributes

final def +=(edge: E): this.type

Alias for addOne(edge).

Alias for addOne(edge).

Attributes

def addAll(xs: Iterable[OuterElem[N, E]]): this.type

Adds all elements produced by outer to this graph.

Adds all elements produced by outer to this graph.

Attributes

def addAll(nodes: Iterable[N], edges: Iterable[E]): this.type

Adds all passed nodes and edges to this graph.

Adds all passed nodes and edges to this graph.

Attributes

def addEdges(edges: Iterable[E]): this.type

Adds all edges to this graph. Nodes being ends of edges are also added if not yet present.

Adds all edges to this graph. Nodes being ends of edges are also added if not yet present.

Attributes

def addNodes(nodes: Iterable[N]): this.type

Adds all nodes to this graph.

Adds all nodes to this graph.

Attributes

def addOne(node: N): this.type

Adds a single node to this graph.

Adds a single node to this graph.

Attributes

def addOne(edge: E): this.type

Adds a single node to this graph.

Adds a single node to this graph.

Attributes