Graph Core
2.0.2
API
Generated with
Graph Core/scalax.collection/scalax.collection.immutable/GraphOps

GraphOps

scalax.collection.immutable.GraphOps
trait GraphOps[N, E <: Edge[N], +CC <: ([X, Y <: Edge[X]] =>> GraphLike[X, Y, CC] & Graph[X, Y])]

Immutable graph only operations.

$define edgesOnlyUseCase Provided for the use case when you don't need to pass any isolated node.

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait AdjacencyListGraph[N, E, CC]
class DefaultGraphImpl[N, E]
trait Graph[N, E]

Members list

Value members

Abstract methods

def --(that: AnyGraph[N, E]): CC[N, E]

Creates a new graph with the elements of this graph minus the elements of that and edges that are incident with any node in that.

Creates a new graph with the elements of this graph minus the elements of that and edges that are incident with any node in that.

Attributes

def excl(node: N): CC[N, E]

Creates a new graph with the elements of this graph minus node and its incident edges.

Creates a new graph with the elements of this graph minus node and its incident edges.

Attributes

def excl(edge: E): CC[N, E]

Creates a new graph with the elements of this graph minus edge.

Creates a new graph with the elements of this graph minus edge.

Attributes

def incl(node: N): CC[N, E]

Creates a new supergraph with an additional node unless this graph already contains node.

Creates a new supergraph with an additional node unless this graph already contains node.

Attributes

def incl(edge: E): CC[N, E]

Creates a new supergraph with an additional edge unless this graph already contains edge.

Creates a new supergraph with an additional edge unless this graph already contains edge.

Attributes

def removedAll(isolatedNodes: IterableOnce[N], edges: IterableOnce[E]): CC[N, E]

Creates a new graph with the elements of this graph minus the passed elements and edges that are incident with any of the passed nodes. Use diff to subtract all nodes and edges of another graph.

Creates a new graph with the elements of this graph minus the passed elements and edges that are incident with any of the passed nodes. Use diff to subtract all nodes and edges of another graph.

Value parameters

edges

to be removed.

isolatedNodes

to be removed. Nodes that are implicitly defined by any edge in edges will be ignored.

Attributes

Concrete methods

final def +(node: N): CC[N, E]

Alias for incl(node).

Alias for incl(node).

Attributes

final def +(edge: E): CC[N, E]

Alias for incl(edge).

Alias for incl(edge).

Attributes

final def -(node: N): CC[N, E]

Alias for excl(node).

Alias for excl(node).

Attributes

final def -(edge: E): CC[N, E]

Alias for incl(edge).

Alias for incl(edge).

Attributes

final def --(isolatedNodes: IterableOnce[N], edges: IterableOnce[E]): CC[N, E]

Alias for removedAll(isolatedNodes, edges).

Alias for removedAll(isolatedNodes, edges).

Attributes

final def --(edges: IterableOnce[E]): CC[N, E]

Alias for removedAll(edges).

Alias for removedAll(edges).

Attributes

final def removedAll(edges: IterableOnce[E]): CC[N, E]

Same as removedAll(isolatedNodes, edges) but with empty isolatedNodes. $edgesOnlyUseCase

Same as removedAll(isolatedNodes, edges) but with empty isolatedNodes. $edgesOnlyUseCase

Attributes

Generated with