trait InnerNodeOps extends AnyRef
- Alphabetic
- By Inheritance
- InnerNodeOps
- AnyRef
- Any
- by EdgeAssoc
- by anyToNode
- by ChainingOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toany2stringadd[GraphLike.InnerNodeOps] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
- final def +~(that: N, those: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): GraphLike.EdgeT
Synonym to
connectWithSynonym to
connectWith- Annotations
- @inline()
- final def +~(that: N)(implicit edgeFactory: EdgeCompanion[E]): GraphLike.EdgeT
Synonym to
connectWithSynonym to
connectWith- Annotations
- @inline()
- final def +~%[EE[+X] <: E[X] with WEdgeBound[X]](that: N, those: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): GraphLike.EdgeT
Synonym to
connectWithW(that, those)(weight).Synonym to
connectWithW(that, those)(weight).- Annotations
- @inline()
- final def +~%[EE[+X] <: E[X] with WEdgeBound[X]](that: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): GraphLike.EdgeT
Synonym to
connectWithW(that)(weight).Synonym to
connectWithW(that)(weight).- Annotations
- @inline()
- final def +~%+[EE[+X] <: E[X] with WLEdgeBound[X], L](that: N, those: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): GraphLike.EdgeT
Synonym to
connectWithWL(that, those)(weight, label).Synonym to
connectWithWL(that, those)(weight, label).- Annotations
- @inline()
- final def +~%+[EE[+X] <: E[X] with WLEdgeBound[X], L](that: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): GraphLike.EdgeT
Synonym to
connectWithWL(that)(weight, label).Synonym to
connectWithWL(that)(weight, label).- Annotations
- @inline()
- final def +~+[EE[+X] <: E[X] with LEdgeBound[X], L](that: N, those: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): GraphLike.EdgeT
Synonym to
connectWithL(that, those)(label).Synonym to
connectWithL(that, those)(label).- Annotations
- @inline()
- final def +~+[EE[+X] <: E[X] with LEdgeBound[X], L](that: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): GraphLike.EdgeT
Synonym to
connectWithL(that)(label).Synonym to
connectWithL(that)(label).- Annotations
- @inline()
- def ->[B](y: B): (GraphLike.InnerNodeOps, B)
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toArrowAssoc[GraphLike.InnerNodeOps] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def connectWith(that: N, those: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): GraphLike.EdgeT
Creates a new inner hyperedge between this node and
thatplusthoseusingedgeFactoryand adds it to the edge set of this graph.Creates a new inner hyperedge between this node and
thatplusthoseusingedgeFactoryand adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as callingaddAndGetEdge(this, that, those)on aGraphinstance.- that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
- those
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
- edgeFactory
An edge companion who's
fromis to serve as the edge factory.- returns
trueif a new hyperedge has been created.falseif no new hyperedge could be created because there exists a corresponding equaling hyperedge.
- Annotations
- @inline()
- final def connectWith(that: N)(implicit edgeFactory: EdgeCompanion[E]): GraphLike.EdgeT
Creates a new inner edge between this node and
thatusingedgeFactoryand adds it to the edge set of this graph.Creates a new inner edge between this node and
thatusingedgeFactoryand adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as callingaddAndGetEdge(this, that).- that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
- edgeFactory
An edge companion who's
fromis to serve as the edge factory.- returns
trueif a new edge has been created.falseif no new edge could be created because there exists a corresponding equaling edge.
- Annotations
- @inline()
- final def connectWithL[EE[+X] <: E[X] with LEdgeBound[X], L](that: N, those: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): GraphLike.EdgeT
Creates a new labeled inner hyperedge between this node and
thatplusthoseusingedgeFactoryand adds it to the edge set of this graph.Creates a new labeled inner hyperedge between this node and
thatplusthoseusingedgeFactoryand adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same asaddAndGetLEdge(this, that, those)(label)on aGraphinstance.- that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
- those
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
- label
The value the labeled edge to be created should have as its label.
- edgeFactory
An edge companion who's
fromis to serve as the edge factory.- returns
trueif a new hyperedge has been created.falseif no new hyperedge could be created because there exists a corresponding equaling hyperedge.
- Annotations
- @inline()
- final def connectWithL[EE[+X] <: E[X] with LEdgeBound[X], L](that: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): GraphLike.EdgeT
Creates a new labeled inner edge between this node and
thatusingedgeFactoryand adds it to the edge set of this graph.Creates a new labeled inner edge between this node and
thatusingedgeFactoryand adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same asaddAndGetLEdge(this, that)(label)on aGraphinstance.- that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
- label
The value the labeled edge to be created should have as its label.
- edgeFactory
An edge companion who's
fromis to serve as the edge factory.- returns
trueif a new edge has been created.falseif no new edge could be created because there exists a corresponding equaling edge.
- Annotations
- @inline()
- final def connectWithW[EE[+X] <: E[X] with WEdgeBound[X]](that: N, those: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): GraphLike.EdgeT
Creates a new weighted inner hyperedge between this node and
thatplusthoseusingedgeFactoryand adds it to the edge set of this graph.Creates a new weighted inner hyperedge between this node and
thatplusthoseusingedgeFactoryand adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same asaddAndGetWEdge(this, that, those)(weight)on aGraphinstance.- that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
- those
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
- weight
The number the weighted edge to be created should have as its weight.
- edgeFactory
An edge companion who's
fromis to serve as the edge factory.- returns
trueif a new hyperedge has been created.falseif no new hyperedge could be created because there exists a corresponding equaling hyperedge.
- Annotations
- @inline()
- final def connectWithW[EE[+X] <: E[X] with WEdgeBound[X]](that: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): GraphLike.EdgeT
Creates a new weighted inner edge between this node and
thatusingedgeFactoryand adds it to the edge set of this graph.Creates a new weighted inner edge between this node and
thatusingedgeFactoryand adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same asaddAndGetWEdge(this, that)(weight)on aGraphinstance.- that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
- weight
The number the weighted edge to be created should have as its weight.
- edgeFactory
An edge companion who's
fromis to serve as the edge factory.- returns
trueif a new edge has been created.falseif no new edge could be created because there exists a corresponding equaling edge.
- Annotations
- @inline()
- final def connectWithWL[EE[+X] <: E[X] with WLEdgeBound[X], L](that: N, those: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): GraphLike.EdgeT
Creates a new weighted and labeled inner hyperedge between this node and
thatplusthoseusingedgeFactoryand adds it to the edge set of this graph.Creates a new weighted and labeled inner hyperedge between this node and
thatplusthoseusingedgeFactoryand adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same asaddAndGetWLEdge(this, that, those)(weight, label)on aGraphinstance.- that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
- those
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
- weight
The number the weighted edge to be created should have as its weight.
- label
The value the labeled edge to be created should have as its label.
- edgeFactory
An edge companion who's
fromis to serve as the edge factory.- returns
trueif a new hyperedge has been created.falseif no new hyperedge could be created because there exists a corresponding equaling hyperedge.
- Annotations
- @inline()
- final def connectWithWL[EE[+X] <: E[X] with WLEdgeBound[X], L](that: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): GraphLike.EdgeT
Creates a new weighted and labeled inner edge between this node and
thatusingedgeFactoryand adds it to the edge set of this graph.Creates a new weighted and labeled inner edge between this node and
thatusingedgeFactoryand adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same asaddAndGetWLEdge(this, that)(weight, label)on aGraphinstance.- that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
- weight
The number the weighted edge to be created should have as its weight.
- label
The value the labeled edge to be created should have as its label.
- edgeFactory
An edge companion who's
fromis to serve as the edge factory.- returns
trueif a new edge has been created.falseif no new edge could be created because there exists a corresponding equaling edge.
- Annotations
- @inline()
- def ensuring(cond: (GraphLike.InnerNodeOps) => Boolean, msg: => Any): GraphLike.InnerNodeOps
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toEnsuring[GraphLike.InnerNodeOps] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (GraphLike.InnerNodeOps) => Boolean): GraphLike.InnerNodeOps
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toEnsuring[GraphLike.InnerNodeOps] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): GraphLike.InnerNodeOps
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toEnsuring[GraphLike.InnerNodeOps] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): GraphLike.InnerNodeOps
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toEnsuring[GraphLike.InnerNodeOps] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toOuterNode[GraphLike.InnerNodeOps] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
- final def isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toOuterNode[GraphLike.InnerNodeOps] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
- def isIn: Boolean
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toOuterNode[GraphLike.InnerNodeOps] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isNode: Boolean
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toOuterNode[GraphLike.InnerNodeOps] 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.InnerNodeOps toOuterNode[GraphLike.InnerNodeOps] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
- val n1: GraphLike.InnerNodeOps
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toEdgeAssoc[GraphLike.InnerNodeOps] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def pipe[B](f: (GraphLike.InnerNodeOps) => B): B
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toChainingOps[GraphLike.InnerNodeOps] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def productElementNames: Iterator[String]
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toOuterNode[GraphLike.InnerNodeOps] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Product
- val self: GraphLike.InnerNodeOps
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toChainingOps[GraphLike.InnerNodeOps] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def stringPrefix: String
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toOuterNode[GraphLike.InnerNodeOps] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tap[U](f: (GraphLike.InnerNodeOps) => U): GraphLike.InnerNodeOps
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toChainingOps[GraphLike.InnerNodeOps] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def toString(): String
- Definition Classes
- AnyRef → Any
- val value: GraphLike.InnerNodeOps
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toOuterNode[GraphLike.InnerNodeOps] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- OuterNode → NodeParam
- 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 ~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toEdgeAssoc[GraphLike.InnerNodeOps] 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.InnerNodeOps toEdgeAssoc[GraphLike.InnerNodeOps] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
Shadowed Implicit Value Members
- def toString(): String
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toOuterNode[GraphLike.InnerNodeOps] 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:(innerNodeOps: OuterNode[GraphLike.InnerNodeOps]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toStringFormat[GraphLike.InnerNodeOps] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)instead ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- def →[B](y: B): (GraphLike.InnerNodeOps, B)
- Implicit
- This member is added by an implicit conversion from GraphLike.InnerNodeOps toArrowAssoc[GraphLike.InnerNodeOps] 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.
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.