GraphLike

trait GraphLike[N, E[+X] <: EdgeLikeIn[X], +This[X, Y[+X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with Graph[X, Y[X]]] extends mutable.GraphLike[N, E, [X, Y[+X]]This[X, Y]] with constrained.GraphLike[N, E, [X, Y[+X]]This[X, Y]] with GraphOps[N, E, [X, Y[+X]]This[X, Y]] with Growable[Param[N, E]] with Shrinkable[Param[N, E]] with Cloneable[This[N, E]]

Self Type: This[N, E] with GraphLike[N, E, This] with Graph[N, E]

Linear Supertypes

GraphOps[N, E, This], constrained.GraphLike[N, E, This], Constrained[N, E, This[N, E]], ConstraintMethods[N, E, This[N, E]], constrained.GraphOps[N, E, This], mutable.GraphLike[N, E, This], EdgeOps[N, E, This], Cloneable[This[N, E]], Cloneable, Shrinkable[Param[N, E]], Growable[Param[N, E]], Clearable, collection.GraphLike[N, E, This], GraphDegree[N, E], GraphTraversal[N, E], GraphBase[N, E], Serializable, GraphAsSet[N, E, This], Set[Param[N, E]], Equals, SetOps[Param[N, E], [_]Set[_], This[N, E]], (Param[N, E]) => Boolean, Iterable[Param[N, E]], IterableFactoryDefaults[Param[N, E], [x]Set[x]], IterableOps[Param[N, E], [_]Set[_], This[N, E]], IterableOnceOps[Param[N, E], [_]Set[_], This[N, E]], scala.collection.IterableOnce[Param[N, E]], AnyRef, Any

Known Subclasses

AdjacencyListGraph, DefaultGraphImpl, Graph, UserConstrainedGraphImpl

Type Hierarchy

Ordering

Alphabetic
By Inheritance

Inherited

GraphLike
GraphOps
GraphLike
Constrained
ConstraintMethods
GraphOps
GraphLike
EdgeOps
Cloneable
Cloneable
Shrinkable
Growable
Clearable
GraphLike
GraphDegree
GraphTraversal
GraphBase
Serializable
GraphAsSet
Set
Equals
SetOps
Function1
Iterable
IterableFactoryDefaults
IterableOps
IterableOnceOps
IterableOnce
AnyRef
Any

Implicitly

by iterableOnceExtensionMethods
by EdgeAssoc
by predicateToNodePredicate
by anyToNode
by ChainingOps
by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc

Hide All
Show All

Visibility

Public
Protected

Type Members

sealed abstract class AbstractTopologicalOrder[+A, +T] extends AbstractIterable[T]
Definition Classes
GraphTraversal
abstract class Component extends Properties
Definition Classes
GraphTraversal
abstract class ComponentTraverser extends FluentProperties[ComponentTraverser] with Properties with Iterable[Component]
Definition Classes
GraphTraversal
abstract type Config <: GraphConfig with GenConstrainedConfig
Attributes
protected
Definition Classes
GraphLike → GraphLike
trait Cycle extends Path
Definition Classes
GraphTraversal
type CycleNodeOrTopologicalOrder = Either[(GraphLike.this)#NodeT, (GraphLike.this)#TopologicalOrder[(GraphLike.this)#NodeT]]
Definition Classes
GraphTraversal
trait DegreeFunction extends ((GraphDegree.this)#NodeT) => Int
Definition Classes
GraphDegree
type DegreeNodeSeqEntry = (Int, (GraphLike.this)#NodeT)
Definition Classes
GraphDegree
final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]
Definition Classes
GraphDegree
trait Edge extends Serializable
Definition Classes
GraphBase
class EdgeBase extends InnerEdgeParam[N, E, (collection.GraphLike.this)#NodeT, E] with (collection.GraphLike.this)#InnerEdge
Definition Classes
GraphLike
type EdgeFilter = ((GraphLike.this)#EdgeT) => Boolean
Definition Classes
GraphBase
sealed trait EdgeOrdering extends Ordering[GraphBase.EdgeT] with ElemOrdering
Definition Classes
GraphBase
trait EdgeSet extends Set[(mutable.GraphLike.this)#EdgeT] with (mutable.GraphLike.this)#EdgeSet with AddSubtract[(mutable.GraphLike.this)#EdgeT, (mutable.GraphLike.this)#EdgeSet]
Definition Classes
GraphLike
abstract type EdgeSetT <: (GraphLike.this)#EdgeSet
Definition Classes
GraphLike → GraphLike → GraphBase
abstract type EdgeT <: InnerEdgeParam[N, E, (GraphLike.this)#NodeT, E] with (GraphLike.this)#InnerEdge with Serializable
Definition Classes
GraphLike → GraphBase
sealed trait ElemOrdering extends AnyRef
Attributes
protected
Definition Classes
GraphBase
trait ExtendedNodeVisitor[U] extends (GraphTraversal.NodeT) => U
Definition Classes
GraphTraversal
trait Filter[T] extends (T) => Boolean
Definition Classes
GraphDegree
abstract class FluentProperties[+This <: FluentProperties[This]] extends AnyRef
Attributes
protected
Definition Classes
GraphTraversal
trait InnerEdge extends (collection.GraphLike.this)#InnerEdge
Definition Classes
GraphLike
abstract class InnerEdgeTraverser extends TraverserMethods[GraphTraversal.EdgeT, InnerEdgeTraverser] with Traverser[GraphTraversal.EdgeT, InnerEdgeTraverser]
Definition Classes
GraphTraversal
sealed trait InnerElem extends AnyRef
Definition Classes
GraphBase
abstract class InnerElemTraverser extends TraverserMethods[GraphTraversal.InnerElem, InnerElemTraverser] with Traverser[GraphTraversal.InnerElem, InnerElemTraverser]
Attributes
protected
Definition Classes
GraphTraversal
trait InnerNode extends (mutable.GraphLike.this)#InnerNode with (mutable.GraphLike.this)#InnerNodeOps
Definition Classes
GraphLike
abstract class InnerNodeDownUpTraverser extends TraverserMethods[(Boolean, GraphTraversal.NodeT), InnerNodeDownUpTraverser] with Traverser[(Boolean, GraphTraversal.NodeT), InnerNodeDownUpTraverser]
Definition Classes
GraphTraversal
trait InnerNodeOps extends AnyRef
Definition Classes
EdgeOps
abstract class InnerNodeTraverser extends TraverserMethods[GraphTraversal.NodeT, InnerNodeTraverser] with Traverser[GraphTraversal.NodeT, InnerNodeTraverser]
Definition Classes
GraphTraversal
case class Layer extends Product with Serializable
Definition Classes
GraphTraversal
final class LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]
Definition Classes
GraphTraversal
type Layers = Iterable[(GraphLike.this)#Layer]
Definition Classes
GraphTraversal
trait Node extends Serializable
Definition Classes
GraphBase
abstract class NodeBase extends (collection.GraphLike.this)#NodeBase with InnerNodeParam[N] with (collection.GraphLike.this)#InnerNode
Attributes
protected
Definition Classes
GraphLike
type NodeFilter = ((GraphLike.this)#NodeT) => Boolean
Definition Classes
GraphBase
sealed trait NodeOrdering extends Ordering[GraphBase.NodeT] with ElemOrdering
Definition Classes
GraphBase
trait NodeSet extends (GraphLike.this)#NodeSet
abstract type NodeSetT <: (GraphLike.this)#NodeSet
Definition Classes
GraphLike → GraphLike → GraphBase
abstract type NodeT <: (GraphLike.this)#InnerNode
Definition Classes
GraphLike → GraphLike → GraphTraversal → GraphBase
abstract class OuterEdgeTraverser extends TraverserMethods[E[N], OuterEdgeTraverser] with Traverser[E[N], OuterEdgeTraverser]
Definition Classes
GraphTraversal
trait OuterElemTraverser extends TraverserMethods[OuterElem[N, E], OuterElemTraverser] with Traverser[OuterElem[N, E], OuterElemTraverser]
Definition Classes
GraphTraversal
abstract class OuterNodeDownUpTraverser extends TraverserMethods[(Boolean, N), OuterNodeDownUpTraverser] with Traverser[(Boolean, N), OuterNodeDownUpTraverser]
Definition Classes
GraphTraversal
abstract class OuterNodeTraverser extends TraverserMethods[N, OuterNodeTraverser] with Traverser[N, OuterNodeTraverser]
Definition Classes
GraphTraversal
trait Path extends Walk
Definition Classes
GraphTraversal
trait PathBuilder extends WalkBuilder with Builder[GraphTraversal.InnerElem, Path]
Definition Classes
GraphTraversal
trait Properties extends SubgraphProperties
Attributes
protected
Definition Classes
GraphTraversal
abstract class StrongComponentTraverser extends FluentProperties[StrongComponentTraverser] with Properties with Iterable[Component]
Definition Classes
GraphTraversal
trait SubgraphProperties extends AnyRef
Attributes
protected
Definition Classes
GraphTraversal
type ThisGraph = GraphLike.this
Attributes
protected
Definition Classes
GraphLike
final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]
Definition Classes
GraphTraversal
trait Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with CompatTraversable[A]
Definition Classes
GraphTraversal
trait TraverserInnerNode extends GraphTraversal.InnerNode
Definition Classes
GraphTraversal
abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]
Attributes
protected
Definition Classes
GraphTraversal
trait Walk extends Iterable[GraphTraversal.InnerElem]
Definition Classes
GraphTraversal
trait WalkBuilder extends Builder[GraphTraversal.InnerElem, Walk] with Growable[GraphTraversal.InnerElem]
Definition Classes
GraphTraversal
class Weight extends AnyRef
Definition Classes
GraphTraversal

Abstract Value Members

abstract def +=#(edge: E[N]): GraphLike.this
Attributes
protected
Definition Classes
GraphLike
abstract def add(edge: E[N]): Boolean
Definition Classes
GraphLike
abstract def add(node: N): Boolean
Definition Classes
GraphLike
abstract def add_?(edge: E[N]): Either[ConstraintViolation, Boolean]
Same as add but $Info.
Same as add but $Info.
Definition Classes
GraphOps
abstract def add_?(node: N): Either[ConstraintViolation, Boolean]
Same as add but $Info.
Same as add but $Info.
Definition Classes
GraphOps
abstract def clear(): Unit
Definition Classes
Clearable
abstract def componentTraverser(parameters: Parameters, subgraphNodes: (GraphLike.this)#NodeFilter, subgraphEdges: (GraphLike.this)#EdgeFilter, ordering: (GraphLike.this)#ElemOrdering, maxWeight: Option[(GraphLike.this)#Weight]): (GraphLike.this)#ComponentTraverser
Definition Classes
GraphTraversal
implicit abstract def config: generic.GraphConstrainedCompanion.Config with (GraphLike.this)#Config
Definition Classes
GraphLike
abstract val constraintFactory: ConstraintCompanion[Constraint]
Definition Classes
GraphLike
implicit abstract val edgeT: ClassTag[E[N]]
Definition Classes
GraphLike
abstract def edges: (GraphLike.this)#EdgeSetT
Definition Classes
GraphBase
abstract val graphCompanion: GraphConstrainedCompanion[[X, Y[+X]]This[X, Y]]
Definition Classes
GraphLike → GraphAsSet
abstract def innerEdgeTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphLike.this)#NodeFilter, subgraphEdges: (GraphLike.this)#EdgeFilter, ordering: (GraphLike.this)#ElemOrdering, maxWeight: Option[(GraphLike.this)#Weight]): (GraphLike.this)#InnerEdgeTraverser
Definition Classes
GraphTraversal
abstract def innerElemTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphLike.this)#NodeFilter, subgraphEdges: (GraphLike.this)#EdgeFilter, ordering: (GraphLike.this)#ElemOrdering, maxWeight: Option[(GraphLike.this)#Weight]): (GraphLike.this)#InnerElemTraverser
Definition Classes
GraphTraversal
abstract def innerNodeDownUpTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphLike.this)#NodeFilter, subgraphEdges: (GraphLike.this)#EdgeFilter, ordering: (GraphLike.this)#ElemOrdering, maxWeight: Option[(GraphLike.this)#Weight]): (GraphLike.this)#InnerNodeDownUpTraverser
Definition Classes
GraphTraversal
abstract def innerNodeTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphLike.this)#NodeFilter, subgraphEdges: (GraphLike.this)#EdgeFilter, ordering: (GraphLike.this)#ElemOrdering, maxWeight: Option[(GraphLike.this)#Weight]): (GraphLike.this)#InnerNodeTraverser
Definition Classes
GraphTraversal
abstract def newEdge(innerEdge: E[(GraphLike.this)#NodeT]): (GraphLike.this)#EdgeT
Attributes
protected
Definition Classes
GraphBase
abstract def newNode(n: N): (GraphLike.this)#NodeT
Attributes
protected
Definition Classes
GraphBase
abstract def newPathBuilder(start: (GraphLike.this)#NodeT)(implicit sizeHint: Int, edgeSelector: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => Option[(GraphLike.this)#EdgeT]): (GraphLike.this)#PathBuilder
Definition Classes
GraphTraversal
abstract def newWalkBuilder(start: (GraphLike.this)#NodeT)(implicit sizeHint: Int, edgeSelector: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => Option[(GraphLike.this)#EdgeT]): (GraphLike.this)#WalkBuilder
Definition Classes
GraphTraversal
abstract def nodes: (GraphLike.this)#NodeSetT
Definition Classes
GraphBase
abstract def outerEdgeTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphLike.this)#NodeFilter, subgraphEdges: (GraphLike.this)#EdgeFilter, ordering: (GraphLike.this)#ElemOrdering, maxWeight: Option[(GraphLike.this)#Weight]): (GraphLike.this)#OuterEdgeTraverser
Definition Classes
GraphTraversal
abstract def outerElemTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphLike.this)#NodeFilter, subgraphEdges: (GraphLike.this)#EdgeFilter, ordering: (GraphLike.this)#ElemOrdering, maxWeight: Option[(GraphLike.this)#Weight]): (GraphLike.this)#OuterElemTraverser
Definition Classes
GraphTraversal
abstract def outerNodeDownUpTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphLike.this)#NodeFilter, subgraphEdges: (GraphLike.this)#EdgeFilter, ordering: (GraphLike.this)#ElemOrdering, maxWeight: Option[(GraphLike.this)#Weight]): (GraphLike.this)#OuterNodeDownUpTraverser
Definition Classes
GraphTraversal
abstract def outerNodeTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphLike.this)#NodeFilter, subgraphEdges: (GraphLike.this)#EdgeFilter, ordering: (GraphLike.this)#ElemOrdering, maxWeight: Option[(GraphLike.this)#Weight]): (GraphLike.this)#OuterNodeTraverser
Definition Classes
GraphTraversal
abstract def preAdd(edge: E[N]): PreCheckResult
This pre-check must return Abort if the addition is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the outer edge is allowed to be added.
This pre-check must return Abort if the addition is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the outer edge is allowed to be added. If postAdd has been implemented, this method may always return PostCheck. This pre-check may be omitted by letting it always return postCheck and overriding the corresponding post-check commit* method. Use self to access the associated graph.
edge
to be added.
returns
The results of the pre-check containing the follow-up activity and possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.
Definition Classes
ConstraintMethods
abstract def preAdd(node: N): PreCheckResult
This pre-check must return Abort if the addition is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the outer node is allowed to be added.
This pre-check must return Abort if the addition is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the outer node is allowed to be added. If postAdd has been implemented, this method may always return PostCheck. This pre-check may be omitted by letting it always return postCheck and overriding the corresponding post-check commit* method. Use self to access the associated graph.
node
to be added
returns
The results of the pre-check containing the follow-up activity and possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.
Definition Classes
ConstraintMethods
abstract def preSubtract(edge: This.EdgeT, simple: Boolean): PreCheckResult
This pre-check must return Abort if the subtraction of edge is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if the the edge is allowed to be subtracted.
This pre-check must return Abort if the subtraction of edge is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if the the edge is allowed to be subtracted. This pre-check may be omitted by letting it always return postCheck and overriding the corresponding post-check commit* method. Use self to access the associated graph.
edge
the inner edge to be subtracted.
simple
true for standard (edge-only by -), false for ripple (by -!) removal.
returns
The results of the pre-check containing the follow-up activity and possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.
Definition Classes
ConstraintMethods
abstract def preSubtract(node: This.NodeT, forced: Boolean): PreCheckResult
This pre-check must return Abort if the subtraction of node is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if the the node is allowed to be subtracted.
This pre-check must return Abort if the subtraction of node is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if the the node is allowed to be subtracted. This pre-check may be omitted by letting it always return postCheck and overriding the corresponding post-check commit* method. Use self to access the associated graph.
node
the inner to be subtracted.
forced
true for standard (ripple by -), false for gentle (by -?) removal.
returns
The results of the pre-check containing the follow-up activity and possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.
Definition Classes
ConstraintMethods
abstract def remove_?(edge: E[N]): Either[ConstraintViolation, Boolean]
Same as remove but $Info.
Same as remove but $Info.
Definition Classes
GraphOps
abstract def remove_?(node: N): Either[ConstraintViolation, Boolean]
Same as remove but $Info.
Same as remove but $Info.
Definition Classes
GraphOps
abstract val self: This[N, E]
When extending Constraint, self will denote the attached constrained graph.
When extending Constraint, self will denote the attached constrained graph. The factory methods of the companion object scalax.collection.constrained.Graph initialize self to the correct graph instance. When extending Constrained, self will denote this graph.
Definition Classes
ConstraintMethods
abstract def strongComponentTraverser(parameters: Parameters, subgraphNodes: (GraphLike.this)#NodeFilter, subgraphEdges: (GraphLike.this)#EdgeFilter, ordering: (GraphLike.this)#ElemOrdering, maxWeight: Option[(GraphLike.this)#Weight]): (GraphLike.this)#StrongComponentTraverser
Definition Classes
GraphTraversal
abstract def upsert(edge: E[N]): Boolean
Definition Classes
GraphLike

Concrete Value Members

final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def ##(): Int
Definition Classes
AnyRef → Any
final def &(that: Set[Param[N, E]]): This[N, E]
Definition Classes
SetOps
Annotations
@inline()
def &=(coll: Iterable[Param[N, E]]): GraphLike.this
Definition Classes
GraphLike
final def &~(that: Set[Param[N, E]]): This[N, E]
Definition Classes
SetOps
Annotations
@inline()
def +(node: N): This[N, E]
Definition Classes
GraphLike → GraphLike → GraphLike
final def +(elem: Param[N, E]): This[N, E]
Definition Classes
GraphOps
final def +#(e: E[N]): This[N, E]
Attributes
protected
Definition Classes
GraphLike → GraphLike
final def +#?(e: E[N]): Either[ConstraintViolation, This[N, E]]
Attributes
protected
Definition Classes
GraphLike → GraphLike
final def ++(that: scala.collection.IterableOnce[Param[N, E]]): This[N, E]
Definition Classes
SetOps
Annotations
@inline()
final def ++[B >: Param[N, E]](suffix: scala.collection.IterableOnce[B]): Set[B]
Definition Classes
IterableOps
Annotations
@inline()
final def ++=(xs: scala.collection.IterableOnce[Param[N, E]]): GraphLike.this
Definition Classes
Growable
Annotations
@inline()
def ++=?(elems: TraversableOnce[Param[N, E]]): Either[ConstraintViolation, GraphLike.this]
Same as ++= but $Info.
Same as ++= but $Info.
Definition Classes
GraphLike → GraphOps
def ++?(elems: scala.IterableOnce[Param[N, E]]): Either[ConstraintViolation, This[N, E]]
Same as ++ but $Info.
Same as ++ but $Info.
Definition Classes
GraphLike → GraphOps
final def +=(node: N): GraphLike.this
Definition Classes
GraphLike
Annotations
@inline()
final def +=(elem: Param[N, E]): GraphLike.this
Definition Classes
Growable
Annotations
@inline()
def +=#?(edge: E[N]): Either[ConstraintViolation, GraphLike.this]
Attributes
protected
Definition Classes
GraphOps
def +=?(elem: Param[N, E]): Either[ConstraintViolation, GraphLike.this]
Same as += but $Info.
Same as += but $Info.
Definition Classes
GraphOps
def +=?(node: N): Either[ConstraintViolation, GraphLike.this]
Same as += but $Info.
Same as += but $Info.
Definition Classes
GraphOps
def +?(node: N): Either[ConstraintViolation, This[N, E]]
Same as + but $Info.
Same as + but $Info.
Definition Classes
GraphLike → GraphOps
def +?(elem: Param[N, E]): Either[ConstraintViolation, This[N, E]]
Same as + but $Info.
Same as + but $Info.
Definition Classes
GraphLike → GraphOps
final def +~%+=[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): GraphLike.this
Definition Classes
EdgeOps
Annotations
@inline()
final def +~%+=[EE[+X] <: E[X] with WLEdgeBound[X], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): GraphLike.this
Definition Classes
EdgeOps
Annotations
@inline()
final def +~%=[EE[+X] <: E[X] with WHyperEdgeBound[X]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): GraphLike.this
Definition Classes
EdgeOps
Annotations
@inline()
final def +~%=[EE[+X] <: E[X] with WEdgeBound[X]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): GraphLike.this
Definition Classes
EdgeOps
Annotations
@inline()
final def +~+=[EE[+X] <: E[X] with LHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): GraphLike.this
Definition Classes
EdgeOps
Annotations
@inline()
final def +~+=[EE[+X] <: E[X] with LEdgeBound[X], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): GraphLike.this
Definition Classes
EdgeOps
Annotations
@inline()
final def +~=(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind): GraphLike.this
Definition Classes
EdgeOps
Annotations
@inline()
final def +~=(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): GraphLike.this
Definition Classes
EdgeOps
Annotations
@inline()
final def -(elem: Param[N, E]): This[N, E]
Definition Classes
GraphOps
final def -(edge: E[N]): This[N, E]
Definition Classes
GraphLike
Annotations
@inline()
final def -(node: N): This[N, E]
Definition Classes
GraphLike → GraphLike
Annotations
@inline()
final def -!(edge: E[N]): This[N, E]
Definition Classes
GraphLike
Annotations
@inline()
final def -!#(edge: E[N]): This[N, E]
Attributes
protected
Definition Classes
GraphLike → GraphLike
Annotations
@inline()
def -!=(elem: Param[N, E]): GraphLike.this
Definition Classes
GraphLike
final def -!=#(edge: E[N]): GraphLike.this
Attributes
protected
Definition Classes
GraphLike
Annotations
@inline()
final def -#(e: E[N]): This[N, E]
Attributes
protected
Definition Classes
GraphLike → GraphLike
final def -#?(e: E[N]): Either[ConstraintViolation, This[N, E]]
Attributes
protected
Definition Classes
GraphLike → GraphLike
final def --(elems: scala.IterableOnce[Param[N, E]]): This[N, E]
Definition Classes
GraphOps
final def --!=(coll: Iterable[Param[N, E]]): This[N, E]
Definition Classes
GraphLike
Annotations
@inline()
final def --=(xs: scala.collection.IterableOnce[Param[N, E]]): GraphLike.this
Definition Classes
Shrinkable
Annotations
@inline()
def --=?(elems: TraversableOnce[Param[N, E]]): Either[ConstraintViolation, GraphLike.this]
Same as --= but $Info.
Same as --= but $Info.
Definition Classes
GraphLike → GraphOps
def --?(elems: scala.IterableOnce[Param[N, E]]): Either[ConstraintViolation, This[N, E]]
Same as -- but $Info.
Same as -- but $Info.
Definition Classes
GraphLike → GraphOps
final def -=(node: N): GraphLike.this
Definition Classes
GraphLike
Annotations
@inline()
def -=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): GraphLike.this
Definition Classes
Shrinkable
final def -=(elem: Param[N, E]): GraphLike.this
Definition Classes
Shrinkable
Annotations
@inline()
final def -=#(edge: E[N]): GraphLike.this
Attributes
protected
Definition Classes
GraphLike
Annotations
@inline()
def -=#?(edge: E[N]): Either[ConstraintViolation, GraphLike.this]
Attributes
protected
Definition Classes
GraphOps
def -=?(elem: Param[N, E]): Either[ConstraintViolation, GraphLike.this]
Same as -= but $Info.
Same as -= but $Info.
Definition Classes
GraphOps
def -=?(node: N): Either[ConstraintViolation, GraphLike.this]
Same as -= but $Info.
Same as -= but $Info.
Definition Classes
GraphOps
def ->[B](y: B): (GraphLike[N, E, This], B)
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toArrowAssoc[GraphLike[N, E, This]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
final def -?(node: N): Either[ConstraintViolation, This[N, E]]
Same as - but $Info.
Same as - but $Info.
Definition Classes
GraphLike → GraphOps
def -?(elem: Param[N, E]): Either[ConstraintViolation, This[N, E]]
Same as - but $Info.
Same as - but $Info.
Definition Classes
GraphLike → GraphOps
final def -?=(node: N): GraphLike.this
Definition Classes
GraphLike
Annotations
@inline()
final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
def addAll(elems: TraversableOnce[Param[N, E]]): GraphLike.this
Definition Classes
GraphLike → Growable
final def addAndGet(edge: E[N]): (GraphLike.this)#EdgeT
Definition Classes
GraphLike
Annotations
@inline()
final def addAndGet(node: N): (GraphLike.this)#NodeT
Definition Classes
GraphLike
Annotations
@inline()
def addAndGetEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind): (GraphLike.this)#EdgeT
Definition Classes
EdgeOps
final def addAndGetEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): (GraphLike.this)#EdgeT
Definition Classes
EdgeOps
Annotations
@inline()
def addAndGetLEdge[EE[+X] <: E[X] with LHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): (GraphLike.this)#EdgeT
Definition Classes
EdgeOps
final def addAndGetLEdge[EE[+X] <: E[X] with LEdgeBound[X], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): (GraphLike.this)#EdgeT
Definition Classes
EdgeOps
Annotations
@inline()
def addAndGetWEdge[EE[+X] <: E[X] with WHyperEdgeBound[X]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): (GraphLike.this)#EdgeT
Definition Classes
EdgeOps
final def addAndGetWEdge[EE[+X] <: E[X] with WEdgeBound[X]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): (GraphLike.this)#EdgeT
Definition Classes
EdgeOps
Annotations
@inline()
def addAndGetWLEdge[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): (GraphLike.this)#EdgeT
Definition Classes
EdgeOps
final def addAndGetWLEdge[EE[+X] <: E[X] with WLEdgeBound[X], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): (GraphLike.this)#EdgeT
Definition Classes
EdgeOps
Annotations
@inline()
final def addEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind): Boolean
Definition Classes
EdgeOps
Annotations
@inline()
final def addEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): Boolean
Definition Classes
EdgeOps
Annotations
@inline()
final def addLEdge[EE[+X] <: E[X] with LHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): Boolean
Definition Classes
EdgeOps
Annotations
@inline()
final def addLEdge[EE[+X] <: E[X] with LEdgeBound[X], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): Boolean
Definition Classes
EdgeOps
Annotations
@inline()
def addOne(elem: Param[N, E]): GraphLike.this
Definition Classes
GraphLike → Growable
final def addString(b: StringBuilder): StringBuilder
Definition Classes
IterableOnceOps
Annotations
@inline()
final def addString(b: StringBuilder, sep: String): StringBuilder
Definition Classes
IterableOnceOps
Annotations
@inline()
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
Definition Classes
IterableOnceOps
final def addWEdge[EE[+X] <: E[X] with WHyperEdgeBound[X]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Boolean
Definition Classes
EdgeOps
Annotations
@inline()
final def addWEdge[EE[+X] <: E[X] with WEdgeBound[X]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): Boolean
Definition Classes
EdgeOps
Annotations
@inline()
final def addWLEdge[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Boolean
Definition Classes
EdgeOps
Annotations
@inline()
final def addWLEdge[EE[+X] <: E[X] with WLEdgeBound[X], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): Boolean
Definition Classes
EdgeOps
Annotations
@inline()
def allNodes(passedNodes: Iterable[N], passedEdges: Iterable[E[N]]): Set[N]
Consolidates all outer nodes of the arguments by adding the edge ends of passedEdges to passedNodes.
Consolidates all outer nodes of the arguments by adding the edge ends of passedEdges to passedNodes.
Attributes
protected
Definition Classes
ConstraintMethods
def andThen[A](g: (Boolean) => A): (Param[N, E]) => A
Definition Classes
Function1
Annotations
@unspecialized()
final val anyEdge: (GraphLike.this)#EdgeFilter
Definition Classes
GraphBase
final def anyEdgeSelector(from: (GraphLike.this)#NodeT, to: (GraphLike.this)#NodeT): Option[(GraphLike.this)#EdgeT]
Definition Classes
GraphTraversal
Annotations
@inline()
final val anyNode: (GraphLike.this)#NodeFilter
Definition Classes
GraphBase
final lazy val anyOrdering: AnyOrdering[N]
Attributes
protected
Definition Classes
GraphBase
final def apply(elem: Param[N, E]): Boolean
Definition Classes
SetOps → Function1
Annotations
@inline()
final def asInstanceOf[T0]: T0
Definition Classes
Any
def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: (GraphLike.this)#NodeOrdering, ordEdge: (GraphLike.this)#EdgeOrdering): String
Definition Classes
GraphLike
final def bulkOp(elems: IterableOnce[Param[N, E]], isPlusPlus: Boolean): This[N, E]
Attributes
protected
Definition Classes
GraphLike → GraphAsSet
def canEqual(that: Any): Boolean
Definition Classes
Set → Equals
def checkSuspended: Boolean
Attributes
protected
Definition Classes
GraphLike
def checkedMinusEdge(edge: E[N], simple: Boolean, copy: (E[N], (GraphLike.this)#EdgeT) => This[N, E]): Either[ConstraintViolation, This[N, E]]
Attributes
protected
Definition Classes
GraphLike
def checkedMinusNode(node: N, forced: Boolean, copy: (N, (GraphLike.this)#NodeT) => This[N, E]): Either[ConstraintViolation, This[N, E]]
Attributes
protected
Definition Classes
GraphLike
def checkedPlus(contained: => Boolean, preAdd: => PreCheckResult, copy: => This[N, E], nodes: => Iterable[N], edges: => Iterable[E[N]]): Either[ConstraintViolation, This[N, E]]
Attributes
protected
Definition Classes
GraphLike
def className: String
Attributes
protected[this]
Definition Classes
Iterable
def clone(): This[N, E]
Definition Classes
GraphLike → Cloneable → AnyRef
final def coll: GraphLike.this
Attributes
protected
Definition Classes
Iterable → IterableOps
def collect[B](pf: PartialFunction[Param[N, E], B]): Set[B]
Definition Classes
IterableOps → IterableOnceOps
def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
Definition Classes
IterableOnceOps
def compose[A](g: (A) => Param[N, E]): (A) => Boolean
Definition Classes
Function1
Annotations
@unspecialized()
final def concat(elems: scala.IterableOnce[Param[N, E]]): This[N, E]
Definition Classes
GraphOps
def concat[B >: Param[N, E]](suffix: scala.collection.IterableOnce[B]): Set[B]
Definition Classes
IterableOps
def contains(elem: Param[N, E]): Boolean
Definition Classes
GraphLike → SetOps
def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Int
Definition Classes
IterableOnceOps
def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Int
Definition Classes
IterableOnceOps
def copyToArray[B >: Param[N, E]](xs: Array[B]): Int
Definition Classes
IterableOnceOps
def corresponds[B](that: scala.collection.IterableOnce[B])(p: (Param[N, E], B) => Boolean): Boolean
Definition Classes
IterableOnceOps
def count(p: (Param[N, E]) => Boolean): Int
Definition Classes
IterableOnceOps
final lazy val defaultEdgeOrdering: (GraphLike.this)#EdgeOrdering
Definition Classes
GraphBase
final lazy val defaultNodeOrdering: (GraphLike.this)#NodeOrdering
Definition Classes
GraphBase
final def defaultPathSize: Int
Attributes
protected
Definition Classes
GraphTraversal
Annotations
@inline()
def degreeCount(implicit nodeDegree: (GraphLike.this)#DegreeFunction, degreeFilter: (Int) => Boolean): SortedMap[Int, Int]
Definition Classes
GraphDegree
def degreeNodeSeq(implicit nodeDegree: (GraphLike.this)#DegreeFunction, degreeFilter: (Int) => Boolean): Seq[(GraphLike.this)#DegreeNodeSeqEntry]
Definition Classes
GraphDegree
def degreeNodesMap(implicit nodeDegree: (GraphLike.this)#DegreeFunction, degreeFilter: (Int) => Boolean): SortedMap[Int, AnySet[(GraphLike.this)#NodeT]]
Definition Classes
GraphDegree
def degreeSeq(implicit nodeDegree: (GraphLike.this)#DegreeFunction, degreeFilter: (Int) => Boolean): Seq[Int]
Definition Classes
GraphDegree
def degreeSet(implicit nodeDegree: (GraphLike.this)#DegreeFunction, degreeFilter: (Int) => Boolean): SortedSet[Int]
Definition Classes
GraphDegree
def diff(that: AnySet[Param[N, E]]): This[N, E]
Definition Classes
GraphAsSet → SetOps
def drop(n: Int): This[N, E]
Definition Classes
IterableOps → IterableOnceOps
def dropRight(n: Int): This[N, E]
Definition Classes
IterableOps
def dropWhile(p: (Param[N, E]) => Boolean): This[N, E]
Definition Classes
IterableOps → IterableOnceOps
implicit final def edgeToEdgeCont(e: E[N]): E[(GraphLike.this)#NodeT]
Attributes
protected
Definition Classes
GraphBase
def empty: This[N, E]
Definition Classes
GraphAsSet → IterableFactoryDefaults → IterableOps
def ensuring(cond: (GraphLike[N, E, This]) => Boolean, msg: => Any): GraphLike[N, E, This]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toEnsuring[GraphLike[N, E, This]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (GraphLike[N, E, This]) => Boolean): GraphLike[N, E, This]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toEnsuring[GraphLike[N, E, This]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: => Any): GraphLike[N, E, This]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toEnsuring[GraphLike[N, E, This]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): GraphLike[N, E, This]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toEnsuring[GraphLike[N, E, This]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(that: Any): Boolean
Definition Classes
GraphLike → Set → Equals → AnyRef → Any
def excl(elem: Param[N, E]): This[N, E]
Definition Classes
GraphLike
def exists(p: (Param[N, E]) => Boolean): Boolean
Definition Classes
IterableOnceOps
def filter(pred: (Param[N, E]) => Boolean): This[N, E]
Definition Classes
IterableOps → IterableOnceOps
def filterNot(pred: (Param[N, E]) => Boolean): This[N, E]
Definition Classes
IterableOps → IterableOnceOps
final def find(outerEdge: E[N]): Option[(GraphLike.this)#EdgeT]
Definition Classes
GraphLike
Annotations
@inline()
final def find(outerNode: N): Option[(GraphLike.this)#NodeT]
Definition Classes
GraphLike
Annotations
@inline()
def find(p: (Param[N, E]) => Boolean): Option[Param[N, E]]
Definition Classes
IterableOnceOps
final def findCycle[U](implicit visitor: ((GraphLike.this)#InnerElem) => U): Option[(GraphLike.this)#Cycle]
Definition Classes
GraphTraversal
final def findCycleContaining[U](node: (GraphLike.this)#NodeT)(implicit visitor: ((GraphLike.this)#InnerElem) => U): Option[(GraphLike.this)#Cycle]
Definition Classes
GraphTraversal
def flatMap[B](f: (Param[N, E]) => scala.collection.IterableOnce[B]): Set[B]
Definition Classes
IterableOps → IterableOnceOps
def flatten[B](implicit asIterable: (Param[N, E]) => scala.collection.IterableOnce[B]): Set[B]
Definition Classes
IterableOps → IterableOnceOps
def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) => A1): A1
Definition Classes
IterableOnceOps
def foldLeft[B](z: B)(op: (B, Param[N, E]) => B): B
Definition Classes
IterableOnceOps
def foldRight[B](z: B)(op: (Param[N, E], B) => B): B
Definition Classes
IterableOnceOps
def forall(p: (Param[N, E]) => Boolean): Boolean
Definition Classes
IterableOnceOps
def foreach[U](f: (Param[N, E]) => U): Unit
Definition Classes
IterableOnceOps
def formatted(fmtstr: String): String
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toStringFormat[GraphLike[N, E, This]] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@inline()
def fromSpecific(coll: IterableOnce[Param[N, E]]): This[N, E]
Attributes
protected
Definition Classes
GraphAsSet → IterableFactoryDefaults → IterableOps
final def get(outerEdge: E[N]): (GraphLike.this)#EdgeT
Definition Classes
GraphLike
Annotations
@inline()
final def get(outerNode: N): (GraphLike.this)#NodeT
Definition Classes
GraphLike
Annotations
@inline()
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
final def getOrElse(outerEdge: E[N], default: (GraphLike.this)#EdgeT): (GraphLike.this)#EdgeT
Definition Classes
GraphLike
Annotations
@inline()
final def getOrElse(outerNode: N, default: (GraphLike.this)#NodeT): (GraphLike.this)#NodeT
Definition Classes
GraphLike
Annotations
@inline()
def graphSize: Int
Definition Classes
GraphBase
def groupBy[K](f: (Param[N, E]) => K): Map[K, This[N, E]]
Definition Classes
IterableOps
def groupMap[K, B](key: (Param[N, E]) => K)(f: (Param[N, E]) => B): Map[K, Set[B]]
Definition Classes
IterableOps
def groupMapReduce[K, B](key: (Param[N, E]) => K)(f: (Param[N, E]) => B)(reduce: (B, B) => B): Map[K, B]
Definition Classes
IterableOps
def grouped(size: Int): Iterator[This[N, E]]
Definition Classes
IterableOps
def hashCode(): Int
Definition Classes
Set → AnyRef → Any
def having(node: (GraphLike.this)#NodeFilter, edge: (GraphLike.this)#EdgeFilter): PartialFunction[Param[N, E], Boolean]
Definition Classes
GraphLike
def head: Param[N, E]
Definition Classes
IterableOps
def headOption: Option[Param[N, E]]
Definition Classes
IterableOps
def incl(elem: Param[N, E]): This[N, E]
Definition Classes
GraphLike
def init: This[N, E]
Definition Classes
IterableOps
def initialize(nodes: Iterable[N], edges: Iterable[E[N]]): Unit
Attributes
protected
Definition Classes
GraphBase
def inits: Iterator[This[N, E]]
Definition Classes
IterableOps
def intersect(that: Set[Param[N, E]]): This[N, E]
Definition Classes
SetOps
final def isAcyclic: Boolean
Definition Classes
GraphTraversal
Annotations
@inline()
def isComplete: Boolean
Definition Classes
GraphTraversal
def isConnected: Boolean
Definition Classes
GraphTraversal
final def isCustomEdgeFilter(f: (GraphLike.this)#EdgeFilter): Boolean
Definition Classes
GraphBase
Annotations
@inline()
final def isCustomNodeFilter(f: (GraphLike.this)#NodeFilter): Boolean
Definition Classes
GraphBase
Annotations
@inline()
final def isCyclic: Boolean
Definition Classes
GraphTraversal
Annotations
@inline()
def isDefined: Boolean
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
Definition Classes
Param
def isDirected: Boolean
Definition Classes
GraphLike → GraphBase
final val isDirectedT: Boolean
Attributes
protected
Definition Classes
GraphLike
final def isEdge: Boolean
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
Definition Classes
Param
def isEmpty: Boolean
Definition Classes
IterableOnceOps
def isHyper: Boolean
Definition Classes
GraphLike → GraphBase
final val isHyperT: Boolean
Attributes
protected
Definition Classes
GraphLike
def isIn: Boolean
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
Definition Classes
InParam → Param
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
def isMixed: Boolean
Definition Classes
GraphLike → GraphBase
def isMulti: Boolean
Definition Classes
GraphLike → GraphBase
final val isMultiT: Boolean
Attributes
protected
Definition Classes
GraphLike
def isNode: Boolean
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
Definition Classes
NodeParam
final def isOut: Boolean
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
Definition Classes
Param
def isTraversableAgain: Boolean
Definition Classes
IterableOps → IterableOnceOps
final def isTrivial: Boolean
Definition Classes
GraphBase
Annotations
@inline()
def iterableFactory: IterableFactory[Set]
Definition Classes
Set → Iterable → IterableOps
def iterator: Iterator[Param[N, E]]
Definition Classes
GraphLike → IterableOnce
def knownSize: Int
Definition Classes
GraphLike → Growable → IterableOnce
def last: Param[N, E]
Definition Classes
IterableOps
def lastOption: Option[Param[N, E]]
Definition Classes
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[Param[N, E], B, GraphLike.this]
Definition Classes
Iterable
def map[NN, EE[+X] <: EdgeLikeIn[X]](f: (Param[N, E]) => Param[NN, EE])(implicit edgeT: ClassTag[EE[NN]]): This[NN, EE]
Definition Classes
GraphAsSet
def map[B](f: (Param[N, E]) => B): Set[B]
Definition Classes
IterableOps → IterableOnceOps
def max[B >: Param[N, E]](implicit ord: Ordering[B]): Param[N, E]
Definition Classes
IterableOnceOps
def maxBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
Definition Classes
IterableOnceOps
def maxByOption[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Option[Param[N, E]]
Definition Classes
IterableOnceOps
def maxDegree(implicit nodeDegree: (GraphLike.this)#DegreeFunction, degreeFilter: (Int) => Boolean): Int
Definition Classes
GraphDegree
def maxOption[B >: Param[N, E]](implicit ord: Ordering[B]): Option[Param[N, E]]
Definition Classes
IterableOnceOps
def min[B >: Param[N, E]](implicit ord: Ordering[B]): Param[N, E]
Definition Classes
IterableOnceOps
def minBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
Definition Classes
IterableOnceOps
def minByOption[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Option[Param[N, E]]
Definition Classes
IterableOnceOps
def minDegree(implicit nodeDegree: (GraphLike.this)#DegreeFunction, degreeFilter: (Int) => Boolean): Int
Definition Classes
GraphDegree
def minOption[B >: Param[N, E]](implicit ord: Ordering[B]): Option[Param[N, E]]
Definition Classes
IterableOnceOps
final def minusIsolated(node: N): This[N, E]
Definition Classes
GraphLike → GraphLike
Annotations
@inline()
def minusMinus(delNodes: Iterable[N], delEdges: Iterable[E[N]]): This[N, E]
Attributes
protected
Definition Classes
GraphLike → GraphLike
def minusMinusNodesEdges(delNodes: Iterable[N], delEdges: Iterable[E[N]]): (Set[N], Set[E[N]])
Attributes
protected
Definition Classes
GraphLike
final def mkString: String
Definition Classes
IterableOnceOps
Annotations
@inline()
final def mkString(sep: String): String
Definition Classes
IterableOnceOps
Annotations
@inline()
final def mkString(start: String, sep: String, end: String): String
Definition Classes
IterableOnceOps
val n1: GraphLike[N, E, This]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toEdgeAssoc[GraphLike[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
Definition Classes
EdgeAssoc
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def newSpecificBuilder: Builder[Param[N, E], This[N, E]]
Attributes
protected
Definition Classes
GraphAsSet → IterableFactoryDefaults → IterableOps
final val noNode: (GraphLike.this)#NodeFilter
Definition Classes
GraphBase
def nodesToAdd(passedNodes: Iterable[N], passedEdges: Iterable[E[N]]): Set[N]
Attributes
protected
Definition Classes
ConstraintMethods
def nodesToCEdgeCont[EE[+X] <: E[X] with CHyperEdgeBound[X]](factory: CHyperEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[(GraphLike.this)#NodeT]
Attributes
protected[collection]
Definition Classes
EdgeOps
def nodesToCEdgeCont[EE[+X] <: E[X] with CEdgeBound[X]](factory: CEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N): E[(GraphLike.this)#NodeT]
Attributes
protected[collection]
Definition Classes
EdgeOps
final def nodesToEdge(edgeFactory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit endpointsKind: CollectionKind): (GraphLike.this)#EdgeT
Attributes
protected
Definition Classes
EdgeOps
Annotations
@inline()
final def nodesToEdge(edgeFactory: EdgeCompanion[E], node_1: N, node_2: N): (GraphLike.this)#EdgeT
Attributes
protected
Definition Classes
EdgeOps
Annotations
@inline()
def nodesToEdgeCont(factory: EdgeCompanion[E], node_1: N, node_2: N): E[(GraphLike.this)#NodeT]
Attributes
protected[collection]
Definition Classes
EdgeOps
def nodesToEdgeCont(factory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[(GraphLike.this)#NodeT]
Attributes
protected[collection]
Definition Classes
EdgeOps
final def nodesToLEdge[EE[+X] <: E[X] with LHyperEdgeBound[X], L](edgeFactory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*): (GraphLike.this)#EdgeT
Attributes
protected
Definition Classes
EdgeOps
Annotations
@inline()
final def nodesToLEdge[EE[+X] <: E[X] with LEdgeBound[X], L](edgeFactory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): (GraphLike.this)#EdgeT
Attributes
protected
Definition Classes
EdgeOps
Annotations
@inline()
def nodesToLEdgeCont[EE[+X] <: E[X] with LEdgeBound[X], L](factory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): E[(GraphLike.this)#NodeT]
Attributes
protected[collection]
Definition Classes
EdgeOps
def nodesToLEdgeCont[EE[+X] <: E[X] with LHyperEdgeBound[X], L](factory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[(GraphLike.this)#NodeT]
Attributes
protected[collection]
Definition Classes
EdgeOps
final def nodesToWEdge[EE[+X] <: E[X] with WHyperEdgeBound[X]](edgeFactory: WHyperEdgeCompanion[EE], weight: Double, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): (GraphLike.this)#EdgeT
Attributes
protected
Definition Classes
EdgeOps
Annotations
@inline()
final def nodesToWEdge[EE[+X] <: E[X] with WEdgeBound[X]](edgeFactory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): (GraphLike.this)#EdgeT
Attributes
protected
Definition Classes
EdgeOps
Annotations
@inline()
def nodesToWEdgeCont[EE[+X] <: E[X] with WEdgeBound[X]](factory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): E[(GraphLike.this)#NodeT]
Attributes
protected[collection]
Definition Classes
EdgeOps
def nodesToWEdgeCont[EE[+X] <: E[X] with WHyperEdgeBound[X]](factory: WHyperEdgeCompanion[EE], weight: Double, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[(GraphLike.this)#NodeT]
Attributes
protected[collection]
Definition Classes
EdgeOps
final def nodesToWLEdge[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](edgeFactory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): (GraphLike.this)#EdgeT
Attributes
protected
Definition Classes
EdgeOps
Annotations
@inline()
final def nodesToWLEdge[EE[+X] <: E[X] with WLEdgeBound[X], L](edgeFactory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N): (GraphLike.this)#EdgeT
Attributes
protected
Definition Classes
EdgeOps
Annotations
@inline()
def nodesToWLEdgeCont[EE[+X] <: E[X] with WLEdgeBound[X], L](factory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N): E[(GraphLike.this)#NodeT]
Attributes
protected[collection]
Definition Classes
EdgeOps
def nodesToWLEdgeCont[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](factory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[(GraphLike.this)#NodeT]
Attributes
protected[collection]
Definition Classes
EdgeOps
def nonEmpty: Boolean
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
final def nonTrivial: Boolean
Definition Classes
GraphBase
Annotations
@inline()
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
def order: Int
Definition Classes
GraphBase
final def partition(elems: IterableOnce[Param[N, E]]): Partitions[N, E]
Attributes
protected
Definition Classes
GraphLike
def partition(p: (Param[N, E]) => Boolean): (This[N, E], This[N, E])
Definition Classes
IterableOps
def partitionMap[A1, A2](f: (Param[N, E]) => Either[A1, A2]): (Set[A1], Set[A2])
Definition Classes
IterableOps
def pipe[B](f: (GraphLike[N, E, This]) => B): B
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toChainingOps[GraphLike[N, E, This]] performed by method ChainingOps in scalax.collection.
Definition Classes
ChainingOps
def plusPlus(newNodes: Iterable[N], newEdges: Iterable[E[N]]): This[N, E]
Attributes
protected
Definition Classes
GraphLike → GraphLike
def postAdd(newGraph: This[N, E], passedNodes: Iterable[N], passedEdges: Iterable[E[N]], preCheck: PreCheckResult): Either[PostCheckFailure, This[N, E]]
This post-check must return whether newGraph should be committed or the add operation is to be rolled back.
This post-check must return whether newGraph should be committed or the add operation is to be rolled back. Use self to access the associated graph. For immutable graphs, self maintains the state before the addition but for mutable graphs, it is already mutated to the required state.
newGraph
the after-addition would-be graph waiting for commit.
passedNodes
the normalized nodes passed to the add operation.
passedEdges
the normalized edges passed to the add operation.
preCheck
the result of preAdd.
returns
None to accept newGraph or Some reason for constraint violation resp. rejection
Definition Classes
ConstraintMethods
def postSubtract(newGraph: This[N, E], passedNodes: Iterable[N], passedEdges: Iterable[E[N]], preCheck: PreCheckResult): Either[PostCheckFailure, This[N, E]]
This post-check must return whether newGraph should be committed or the subtraction is to be rolled back.
This post-check must return whether newGraph should be committed or the subtraction is to be rolled back. Use self to access the associated graph. For immutable graphs, self maintains the state before the addition but for mutable graphs, it is already mutated to the required state.
newGraph
the after-subtraction would-be graph waiting for commit.
passedNodes
the normalized nodes passed to the subtraction operation.
passedEdges
the normalized edges passed to the subtraction operation.
preCheck
the result of preSubtract.
returns
None to accept newGraph or Some reason for constraint violation resp. rejection
Definition Classes
ConstraintMethods
def preAdd(elems: InParam[N, E]*): PreCheckResult
This pre-check must return Abort if the addition of the outer nodes and/or edges in elems is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the the outer nodes and/or edges are allowed to be added.
This pre-check must return Abort if the addition of the outer nodes and/or edges in elems is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the the outer nodes and/or edges are allowed to be added. If postAdd has been implemented, this method may always return PostCheck. The default implementation calls preAdd(node)/preAdd(edge) element-wise. As for most cases this won't be satisfactory a domain-specific implementation should be provided. Use self to access the associated graph.
elems
nodes and/or edges to be added possibly containing duplicates.
returns
The results of the pre-check containing the follow-up activity and possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.
Definition Classes
ConstraintMethods
def preCreate(nodes: Iterable[N], edges: Iterable[E[N]]): PreCheckResult
This pre-check is called on constructing a graph through its companion object.
This pre-check is called on constructing a graph through its companion object. It must return whether the graph is allowed to be populated with nodes and edges. The default implementation calls preAdd for each node and edge.
Note that nodes and edges coming from node/edge input streams are not checked. So when utilizing streams the post check postAdd must be served.
nodes
the outer nodes the graph is to be populated with; nodes being edge ends may but need not be contained in nodes.
edges
the outer edges the graph is to be populated with.
returns
The results of the pre-check containing the follow-up activity and possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.
Definition Classes
ConstraintMethods
def preSubtract(nodes: => Set[This.NodeT], edges: => Set[This.EdgeT], simple: Boolean): PreCheckResult
This pre-check must return Abort if the subtraction of nodes and/or edges is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if nodes and/or edges are allowed to be subtracted.
This pre-check must return Abort if the subtraction of nodes and/or edges is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if nodes and/or edges are allowed to be subtracted. It is typically triggered by the -- operation. The default implementation element-wise calls preSubtract(node, simple) or preSubtract(edge, simple), respectively. As for most cases this won't be satisfactory a domain-specific implementation should be provided. Use self to access the associated graph.
nodes
the inner nodes to be subtracted not necessarily including the ends of edges to be subtracted. Call allNodes to get the complete set of nodes to be subtracted.
edges
the inner edges to be subtracted.
simple
true for standard (edge-only by -), false for ripple (by -!) removal.
returns
The results of the pre-check containing the follow-up activity and possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.
Definition Classes
ConstraintMethods
def product[B >: Param[N, E]](implicit num: Numeric[B]): B
Definition Classes
IterableOnceOps
def productElementNames: Iterator[String]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
Definition Classes
Product
def reduce[B >: Param[N, E]](op: (B, B) => B): B
Definition Classes
IterableOnceOps
def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) => B): B
Definition Classes
IterableOnceOps
def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) => B): Option[B]
Definition Classes
IterableOnceOps
def reduceOption[B >: Param[N, E]](op: (B, B) => B): Option[B]
Definition Classes
IterableOnceOps
def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) => B): B
Definition Classes
IterableOnceOps
def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) => B): Option[B]
Definition Classes
IterableOnceOps
final def remove(edge: E[N]): Boolean
Definition Classes
GraphLike
Annotations
@inline()
final def remove(node: N): Boolean
Definition Classes
GraphLike
Annotations
@inline()
final def removeGently(node: N): Boolean
Definition Classes
GraphLike
Annotations
@inline()
final def removeWithNodes(edge: E[N]): Boolean
Definition Classes
GraphLike
Annotations
@inline()
def reversed: Iterable[Param[N, E]]
Attributes
protected
Definition Classes
IterableOnceOps
def scan[B >: Param[N, E]](z: B)(op: (B, B) => B): Set[B]
Definition Classes
IterableOps
def scanLeft[B](z: B)(op: (B, Param[N, E]) => B): Set[B]
Definition Classes
IterableOps → IterableOnceOps
def scanRight[B](z: B)(op: (Param[N, E], B) => B): Set[B]
Definition Classes
IterableOps
def size: Int
Definition Classes
IterableOnceOps
def sizeCompare(that: Iterable[_]): Int
Definition Classes
IterableOps
def sizeCompare(otherSize: Int): Int
Definition Classes
IterableOps
final def sizeIs: SizeCompareOps
Definition Classes
IterableOps
Annotations
@inline()
def slice(from: Int, until: Int): This[N, E]
Definition Classes
IterableOps → IterableOnceOps
def sliding(size: Int, step: Int): Iterator[This[N, E]]
Definition Classes
IterableOps
def sliding(size: Int): Iterator[This[N, E]]
Definition Classes
IterableOps
def span(p: (Param[N, E]) => Boolean): (This[N, E], This[N, E])
Definition Classes
IterableOps → IterableOnceOps
def splitAt(n: Int): (This[N, E], This[N, E])
Definition Classes
IterableOps → IterableOnceOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[Param[N, E], S]): S
Definition Classes
IterableOnce
def stringPrefix: String
Definition Classes
GraphLike → GraphLike → Set → Iterable
def subsetOf(that: Set[Param[N, E]]): Boolean
Definition Classes
SetOps
def subsets(): Iterator[This[N, E]]
Definition Classes
SetOps
def subsets(len: Int): Iterator[This[N, E]]
Definition Classes
SetOps
def subtractAll(xs: scala.collection.IterableOnce[Param[N, E]]): GraphLike.this
Definition Classes
Shrinkable
def subtractOne(elem: Param[N, E]): GraphLike.this
Definition Classes
GraphLike → Shrinkable
def sum[B >: Param[N, E]](implicit num: Numeric[B]): B
Definition Classes
IterableOnceOps
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
def tail: This[N, E]
Definition Classes
IterableOps
def tails: Iterator[This[N, E]]
Definition Classes
IterableOps
def take(n: Int): This[N, E]
Definition Classes
IterableOps → IterableOnceOps
def takeRight(n: Int): This[N, E]
Definition Classes
IterableOps
def takeWhile(p: (Param[N, E]) => Boolean): This[N, E]
Definition Classes
IterableOps → IterableOnceOps
def tap[U](f: (GraphLike[N, E, This]) => U): GraphLike[N, E, This]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toChainingOps[GraphLike[N, E, This]] performed by method ChainingOps in scalax.collection.
Definition Classes
ChainingOps
def tapEach[U](f: (Param[N, E]) => U): This[N, E]
Definition Classes
IterableOps → IterableOnceOps
def to[C1](factory: Factory[Param[N, E], C1]): C1
Definition Classes
IterableOnceOps
def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
Definition Classes
IterableOnceOps
final def toBuffer[B >: Param[N, E]]: Buffer[B]
Definition Classes
IterableOnceOps
Annotations
@inline()
def toIndexedSeq: IndexedSeq[Param[N, E]]
Definition Classes
IterableOnceOps
final def toIterable: GraphLike.this
Definition Classes
Iterable → IterableOps
def toList: List[Param[N, E]]
Definition Classes
IterableOnceOps
def toMap[K, V](implicit ev: <:<[Param[N, E], (K, V)]): Map[K, V]
Definition Classes
IterableOnceOps
def toSeq: Seq[Param[N, E]]
Definition Classes
IterableOnceOps
def toSet[B >: Param[N, E]]: Set[B]
Definition Classes
IterableOnceOps
def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: (GraphLike.this)#NodeOrdering, ordEdge: (GraphLike.this)#EdgeOrdering): String
Definition Classes
GraphLike
def toString(): String
Definition Classes
GraphLike → Set → Function1 → Iterable → AnyRef → Any
def toVector: Vector[Param[N, E]]
Definition Classes
IterableOnceOps
final def topologicalSort[U](implicit visitor: ((GraphLike.this)#InnerElem) => U): (GraphLike.this)#CycleNodeOrTopologicalOrder
Definition Classes
GraphTraversal
final def topologicalSortByComponent[U](implicit visitor: ((GraphLike.this)#InnerElem) => U): Iterable[(GraphLike.this)#CycleNodeOrTopologicalOrder]
Definition Classes
GraphTraversal
def totalDegree(implicit nodeDegree: (GraphLike.this)#DegreeFunction, degreeFilter: (Int) => Boolean): Int
Definition Classes
GraphDegree
def totalWeight: Double
Definition Classes
GraphBase
def transpose[B](implicit asIterable: (Param[N, E]) => Iterable[B]): Set[Set[B]]
Definition Classes
IterableOps
final def union(that: Set[Param[N, E]]): This[N, E]
Definition Classes
SetOps
Annotations
@inline()
def unzip[A1, A2](implicit asPair: (Param[N, E]) => (A1, A2)): (Set[A1], Set[A2])
Definition Classes
IterableOps
def unzip3[A1, A2, A3](implicit asTriple: (Param[N, E]) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
Definition Classes
IterableOps
val value: GraphLike[N, E, This]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
Definition Classes
OuterNode → NodeParam
def view: View[Param[N, E]]
Definition Classes
IterableOps
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
def withFilter(p: (Param[N, E]) => Boolean): WithFilter[Param[N, E], [_]Set[_]]
Definition Classes
IterableOps
final def withoutChecks[R](exec: => R): R
Attributes
protected
Definition Classes
GraphLike
def zip[B](that: scala.collection.IterableOnce[B]): Set[(Param[N, E], B)]
Definition Classes
IterableOps
def zipAll[A1 >: Param[N, E], B](that: Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
Definition Classes
IterableOps
def zipWithIndex: Set[(Param[N, E], Int)]
Definition Classes
IterableOps → IterableOnceOps
final def |(that: Set[Param[N, E]]): This[N, E]
Definition Classes
SetOps
Annotations
@inline()
def ~[N >: N1](n2: N): UnDiEdge[N]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toEdgeAssoc[GraphLike[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
Definition Classes
EdgeAssoc
Annotations
@inline()
def ~>[N >: N1](n2: N): DiEdge[N]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toEdgeAssoc[GraphLike[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
Definition Classes
EdgeAssoc
Annotations
@inline()
object Edge extends Serializable
Definition Classes
GraphBase
Annotations
@transient()
object InnerEdge extends Serializable
Definition Classes
GraphBase
Annotations
@transient()
object InnerNode extends Serializable
Definition Classes
GraphBase
object Node extends Serializable
Definition Classes
GraphBase
Annotations
@transient()
object TraverserInnerNode extends Serializable
Definition Classes
GraphTraversal
Annotations
@transient()

Shadowed Implicit Value Members

def +(other: String): String
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toany2stringadd[GraphLike[N, E, This]] performed by method any2stringadd in scala.Predef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: any2stringadd[GraphLike[N, E, This]]).+(other)
Definition Classes
any2stringadd
def andThen[A](g: (Boolean) => A): (Param[Param[N, E], EI]) => A
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: (Param[Param[N, E], EI]) => Boolean).andThen(g)
Definition Classes
Function1
Annotations
@unspecialized()
def apply(v1: Param[Param[N, E], EI]): Boolean
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: (Param[Param[N, E], EI]) => Boolean).apply(v1)
Definition Classes
Function1
def compose[A](g: (A) => Param[Param[N, E], EI]): (A) => Boolean
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: (Param[Param[N, E], EI]) => Boolean).compose(g)
Definition Classes
Function1
Annotations
@unspecialized()
val self: GraphLike[N, E, This]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toChainingOps[GraphLike[N, E, This]] performed by method ChainingOps in scalax.collection.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: ChainingOps[GraphLike[N, E, This]]).self
Definition Classes
ChainingOps
def stringPrefix: String
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: OuterNode[GraphLike[N, E, This]]).stringPrefix
Definition Classes
NodeParam
def toString(): String
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: (Param[Param[N, E], EI]) => Boolean).toString()
Definition Classes
Function1 → AnyRef → Any
def toString(): String
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: OuterNode[GraphLike[N, E, This]]).toString()
Definition Classes
NodeParam → AnyRef → Any

Deprecated Value Members

def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): This[N, E]
Definition Classes
SetOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs
def ++:[B >: Param[N, E]](that: scala.collection.IterableOnce[B]): Set[B]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
final def +=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): GraphLike.this
Definition Classes
Growable
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use ++= (addAll) instead of varargs +=
def -(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): This[N, E]
Definition Classes
SetOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs
def -!(elem: Param[N, E]): This[N, E]
Definition Classes
GraphLike
Annotations
@deprecated
Deprecated
(Since version 1.13) When deleting an edge, to get nodes deleted that become isolated, delete them beforehand.
def --!(elems: IterableOnce[Param[N, E]]): This[N, E]
Definition Classes
GraphLike
Annotations
@deprecated
Deprecated
(Since version 1.13) When deleting edges, to get nodes deleted that become isolated, delete them beforehand.
def /:[B](z: B)(op: (B, Param[N, E]) => B): B
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]])./:(z)(op)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
final def /:[B](z: B)(op: (B, Param[N, E]) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
def :\[B](z: B)(op: (Param[N, E], B) => B): B
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).:\(z)(op)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
final def :\[B](z: B)(op: (Param[N, E], B) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldRight instead of :\
def aggregate[B](z: => B)(seqop: (B, Param[N, E]) => B, combop: (B, B) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.
def collectFirst[B](f: PartialFunction[Param[N, E], B]): Option[B]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).collectFirst(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.collectFirst(...) instead
def companion: IterableFactory[[_]Set[_]]
Definition Classes
IterableOps
Annotations
@deprecated @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @inline()
Deprecated
(Since version 2.13.0) Use iterableFactory instead
def copyToBuffer(dest: Buffer[Param[N, E]]): Unit
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).copyToBuffer(dest)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.copyToBuffer(...) instead
final def copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use dest ++= coll instead
def count(f: (Param[N, E]) => Boolean): Int
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).count(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.count(...) instead
def exists(f: (Param[N, E]) => Boolean): Boolean
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).exists(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.exists(...) instead
def filter(f: (Param[N, E]) => Boolean): Iterator[Param[N, E]]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).filter(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.filter(...) instead
def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable]) @Deprecated @deprecated
Deprecated
(Since version ) see corresponding Javadoc for more information.
def find(p: (Param[N, E]) => Boolean): Option[Param[N, E]]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).find(p)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.find instead
def flatMap[B](f: (Param[N, E]) => scala.collection.IterableOnce[B]): scala.collection.IterableOnce[B]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).flatMap(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable
def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).fold(z)(op)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.fold instead
def foldLeft[B](z: B)(op: (B, Param[N, E]) => B): B
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).foldLeft(z)(op)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.foldLeft instead
def foldRight[B](z: B)(op: (Param[N, E], B) => B): B
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).foldRight(z)(op)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
def forall(f: (Param[N, E]) => Boolean): Boolean
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).forall(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.forall(...) instead
def foreach[U](f: (Param[N, E]) => U): Unit
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).foreach(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.foreach(...) instead
def hasDefiniteSize: Boolean
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
def isEmpty: Boolean
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).isEmpty
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.isEmpty instead
def map[B](f: (Param[N, E]) => B): scala.collection.IterableOnce[B]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).map(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable
def max(implicit ord: Ordering[Param[N, E]]): Param[N, E]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).max(ord)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.max instead
def maxBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).maxBy(f)(cmp)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.maxBy(...) instead
def min(implicit ord: Ordering[Param[N, E]]): Param[N, E]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).min(ord)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.min instead
def minBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).minBy(f)(cmp)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.minBy(...) instead
def mkString: String
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).mkString
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
def mkString(sep: String): String
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).mkString(sep)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
def mkString(start: String, sep: String, end: String): String
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).mkString(start, sep, end)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.mkString instead
def nonEmpty: Boolean
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).nonEmpty
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.nonEmpty instead
def product(implicit num: Numeric[Param[N, E]]): Param[N, E]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).product(num)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.product instead
def reduce(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).reduce(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduce(...) instead
def reduceLeft(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).reduceLeft(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceLeft(...) instead
def reduceLeftOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).reduceLeftOption(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead
def reduceOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).reduceOption(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceOption(...) instead
def reduceRight(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).reduceRight(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceRight(...) instead
def reduceRightOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).reduceRightOption(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceRightOption(...) instead
final def repr: This[N, E]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
def sameElements[B >: A](that: scala.collection.IterableOnce[B]): Boolean
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.sameElements instead
def seq: GraphLike.this
Definition Classes
Iterable
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
def size: Int
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).size
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.size instead
def sum(implicit num: Numeric[Param[N, E]]): Param[N, E]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).sum(num)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.sum instead
def to[C1](factory: Factory[Param[N, E], C1]): C1
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).to(factory)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.to(factory) instead
def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).toArray(arg0)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.toArray
def toBuffer[B >: A]: Buffer[B]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).toBuffer
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead
def toIndexedSeq: IndexedSeq[Param[N, E]]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).toIndexedSeq
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.toIndexedSeq instead
final def toIterable: Iterable[Param[N, E]]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).toIterable
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
def toIterator: Iterator[Param[N, E]]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).toIterator
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator instead
final def toIterator: Iterator[Param[N, E]]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
def toList: List[Param[N, E]]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).toList
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.to(List) instead
def toMap[K, V](implicit ev: <:<[Param[N, E], (K, V)]): Map[K, V]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).toMap(ev)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.to(Map) instead
def toSeq: Seq[Param[N, E]]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).toSeq
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(Seq) instead
def toSet[B >: A]: Set[B]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).toSet
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(Set) instead
def toStream: Stream[Param[N, E]]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).toStream
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(LazyList) instead
final def toStream: Stream[Param[N, E]]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
final def toTraversable: Traversable[Param[N, E]]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).toTraversable
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
final def toTraversable: Traversable[Param[N, E]]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use toIterable instead
def toVector: Vector[Param[N, E]]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).toVector
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(Vector) instead
def view(from: Int, until: Int): View[Param[N, E]]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)
def withFilter(f: (Param[N, E]) => Boolean): Iterator[Param[N, E]]
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(graphLike: IterableOnceExtensionMethods[Param[N, E]]).withFilter(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.withFilter(...) instead
def →[B](y: B): (GraphLike[N, E, This], B)
Implicit
This member is added by an implicit conversion from GraphLike[N, E, This] toArrowAssoc[GraphLike[N, E, This]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from GraphOps[N, E, This]

Inherited from constrained.GraphLike[N, E, This]

Inherited from Constrained[N, E, This[N, E]]

Inherited from ConstraintMethods[N, E, This[N, E]]

Inherited from constrained.GraphOps[N, E, This]

Inherited from mutable.GraphLike[N, E, This]

Packages

GraphLike

Type Members

Abstract Value Members

Concrete Value Members

Shadowed Implicit Value Members

Deprecated Value Members

Inherited from GraphOps[N, E, This]

Inherited from constrained.GraphLike[N, E, This]

Inherited from Constrained[N, E, This[N, E]]

Inherited from ConstraintMethods[N, E, This[N, E]]

Inherited from constrained.GraphOps[N, E, This]

Inherited from mutable.GraphLike[N, E, This]

Inherited from EdgeOps[N, E, This]

Inherited from Cloneable[This[N, E]]

Inherited from Cloneable

Inherited from Shrinkable[Param[N, E]]

Inherited from Growable[Param[N, E]]

Inherited from Clearable

Inherited from collection.GraphLike[N, E, This]

Inherited from GraphDegree[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from GraphAsSet[N, E, This]

Inherited from Set[Param[N, E]]

Inherited from Equals

Inherited from SetOps[Param[N, E], [_]Set[_], This[N, E]]

Inherited from (Param[N, E]) => Boolean

Inherited from Iterable[Param[N, E]]

Inherited from IterableFactoryDefaults[Param[N, E], [x]Set[x]]

Inherited from IterableOps[Param[N, E], [_]Set[_], This[N, E]]

Inherited from IterableOnceOps[Param[N, E], [_]Set[_], This[N, E]]

Inherited from scala.collection.IterableOnce[Param[N, E]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromGraphLike[N, E, This] to IterableOnceExtensionMethods[Param[N, E]]

Inherited by implicit conversion EdgeAssoc fromGraphLike[N, E, This] to EdgeAssoc[GraphLike[N, E, This]]

Inherited by implicit conversion predicateToNodePredicate fromGraphLike[N, E, This] to (Param[Param[N, E], EI]) => Boolean

Inherited by implicit conversion anyToNode fromGraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]]

Inherited by implicit conversion ChainingOps fromGraphLike[N, E, This] to ChainingOps[GraphLike[N, E, This]]

Inherited by implicit conversion any2stringadd fromGraphLike[N, E, This] to any2stringadd[GraphLike[N, E, This]]

Inherited by implicit conversion StringFormat fromGraphLike[N, E, This] to StringFormat[GraphLike[N, E, This]]

Inherited by implicit conversion Ensuring fromGraphLike[N, E, This] to Ensuring[GraphLike[N, E, This]]

Inherited by implicit conversion ArrowAssoc fromGraphLike[N, E, This] to ArrowAssoc[GraphLike[N, E, This]]

Ungrouped

GraphLike