scalax.collection.mutable.EdgeOps

InnerNodeOps

trait InnerNodeOps extends AnyRef

Self Type
NodeT
Linear Supertypes
AnyRef, Any
Known Subclasses
InnerNode, InnerNodeImpl, NodeBase
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. InnerNodeOps
  2. AnyRef
  3. Any
Implicitly
  1. by anyToNode
  2. by EdgeAssoc
  3. by any2stringadd
  4. by any2stringfmt
  5. by any2ArrowAssoc
  6. by any2Ensuring
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd

  5. final def +~(that: N, those: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): GraphLike.EdgeT

    Synonym to connectWith

    Synonym to connectWith

    Annotations
    @inline()

  6. final def +~(that: N)(implicit edgeFactory: EdgeCompanion[E]): GraphLike.EdgeT

    Synonym to connectWith

    Synonym to connectWith

    Annotations
    @inline()

  7. final def +~%[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N, those: N*)(weight: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): GraphLike.EdgeT

    Synonym to connectWithW(that, those)(weight).

    Synonym to connectWithW(that, those)(weight).

    Annotations
    @inline()

  8. final def +~%[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N)(weight: Long)(implicit edgeFactory: WEdgeCompanion[EE]): GraphLike.EdgeT

    Synonym to connectWithW(that)(weight).

    Synonym to connectWithW(that)(weight).

    Annotations
    @inline()

  9. final def +~%+[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N, those: N*)(weight: Long, 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()

  10. final def +~%+[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N)(weight: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): GraphLike.EdgeT

    Synonym to connectWithWL(that)(weight, label).

    Synonym to connectWithWL(that)(weight, label).

    Annotations
    @inline()

  11. final def +~+[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], 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()

  12. final def +~+[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): GraphLike.EdgeT

    Synonym to connectWithL(that)(label).

    Synonym to connectWithL(that)(label).

    Annotations
    @inline()

  13. def ->[B](y: B): (GraphLike.InnerNodeOps, B)

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to ArrowAssoc[GraphLike.InnerNodeOps] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

  14. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  15. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  16. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  17. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  18. 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 that plus those using edgeFactory and adds it to the edge set of this graph.

    Creates a new inner hyperedge between this node and that plus those using edgeFactory and 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 calling addAndGetEdge(this, that, those) on a Graph instance.

    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 from is to serve as the edge factory.

    returns

    true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

    Annotations
    @inline()

  19. final def connectWith(that: N)(implicit edgeFactory: EdgeCompanion[E]): GraphLike.EdgeT

    Creates a new inner edge between this node and that using edgeFactory and adds it to the edge set of this graph.

    Creates a new inner edge between this node and that using edgeFactory and 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 calling addAndGetEdge(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 from is to serve as the edge factory.

    returns

    true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

    Annotations
    @inline()

  20. final def connectWithL[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N, those: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): GraphLike.EdgeT

    Creates a new labeled inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph.

    Creates a new labeled inner hyperedge between this node and that plus those using edgeFactory and 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 addAndGetLEdge(this, that, those)(label) on a Graph instance.

    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 from is to serve as the edge factory.

    returns

    true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

    Annotations
    @inline()

  21. final def connectWithL[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): GraphLike.EdgeT

    Creates a new labeled inner edge between this node and that using edgeFactory and adds it to the edge set of this graph.

    Creates a new labeled inner edge between this node and that using edgeFactory and 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 addAndGetLEdge(this, that)(label) on a Graph instance.

    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 from is to serve as the edge factory.

    returns

    true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

    Annotations
    @inline()

  22. final def connectWithW[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N, those: N*)(weight: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): GraphLike.EdgeT

    Creates a new weighted inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted inner hyperedge between this node and that plus those using edgeFactory and 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 addAndGetWEdge(this, that, those)(weight) on a Graph instance.

    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 from is to serve as the edge factory.

    returns

    true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

    Annotations
    @inline()

  23. final def connectWithW[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N)(weight: Long)(implicit edgeFactory: WEdgeCompanion[EE]): GraphLike.EdgeT

    Creates a new weighted inner edge between this node and that using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted inner edge between this node and that using edgeFactory and 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 addAndGetWEdge(this, that)(weight) on a Graph instance.

    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 from is to serve as the edge factory.

    returns

    true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

    Annotations
    @inline()

  24. final def connectWithWL[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N, those: N*)(weight: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): GraphLike.EdgeT

    Creates a new weighted and labeled inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted and labeled inner hyperedge between this node and that plus those using edgeFactory and 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 addAndGetWLEdge(this, that, those)(weight, label) on a Graph instance.

    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 from is to serve as the edge factory.

    returns

    true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

    Annotations
    @inline()

  25. final def connectWithWL[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N)(weight: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): GraphLike.EdgeT

    Creates a new weighted and labeled inner edge between this node and that using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted and labeled inner edge between this node and that using edgeFactory and 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 addAndGetWLEdge(this, that)(weight, label) on a Graph instance.

    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 from is to serve as the edge factory.

    returns

    true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

    Annotations
    @inline()

  26. def ensuring(cond: (GraphLike.InnerNodeOps) ⇒ Boolean, msg: ⇒ Any): GraphLike.InnerNodeOps

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to Ensuring[GraphLike.InnerNodeOps] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  27. def ensuring(cond: (GraphLike.InnerNodeOps) ⇒ Boolean): GraphLike.InnerNodeOps

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to Ensuring[GraphLike.InnerNodeOps] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  28. def ensuring(cond: Boolean, msg: ⇒ Any): GraphLike.InnerNodeOps

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to Ensuring[GraphLike.InnerNodeOps] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  29. def ensuring(cond: Boolean): GraphLike.InnerNodeOps

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to Ensuring[GraphLike.InnerNodeOps] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  30. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  31. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  32. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  33. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

  34. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  35. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  36. def isDefined: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to OuterNode[GraphLike.InnerNodeOps] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param

  37. def isEdge: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to OuterNode[GraphLike.InnerNodeOps] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

  38. def isIn: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to OuterNode[GraphLike.InnerNodeOps] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param

  39. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  40. def isNode: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to OuterNode[GraphLike.InnerNodeOps] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

  41. def isOut: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to OuterNode[GraphLike.InnerNodeOps] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param

  42. val n1: GraphLike.InnerNodeOps

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to EdgeAssoc[GraphLike.InnerNodeOps] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc

  43. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  44. final def notify(): Unit

    Definition Classes
    AnyRef

  45. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  46. def stringPrefix: String

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to OuterNode[GraphLike.InnerNodeOps] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

  47. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  48. def toString(): String

    Definition Classes
    AnyRef → Any

  49. val value: GraphLike.InnerNodeOps

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to OuterNode[GraphLike.InnerNodeOps] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam

  50. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  51. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  52. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  53. def ~[N >: N1](n2: N): UnDiEdge[N]

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to EdgeAssoc[GraphLike.InnerNodeOps] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

  54. def ~>[N >: N1](n2: N): DiEdge[N]

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to EdgeAssoc[GraphLike.InnerNodeOps] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

  55. def →[B](y: B): (GraphLike.InnerNodeOps, B)

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to ArrowAssoc[GraphLike.InnerNodeOps] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. val self: Any

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (innerNodeOps: StringAdd).self
    Definition Classes
    StringAdd

  2. val self: Any

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (innerNodeOps: StringFormat).self
    Definition Classes
    StringFormat

  3. def toString(): String

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to OuterNode[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

  1. def x: GraphLike.InnerNodeOps

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to ArrowAssoc[GraphLike.InnerNodeOps] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (innerNodeOps: ArrowAssoc[GraphLike.InnerNodeOps]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  2. def x: GraphLike.InnerNodeOps

    Implicit information
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to Ensuring[GraphLike.InnerNodeOps] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (innerNodeOps: Ensuring[GraphLike.InnerNodeOps]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from GraphLike.InnerNodeOps to OuterNode[GraphLike.InnerNodeOps]

Inherited by implicit conversion EdgeAssoc from GraphLike.InnerNodeOps to EdgeAssoc[GraphLike.InnerNodeOps]

Inherited by implicit conversion any2stringadd from GraphLike.InnerNodeOps to StringAdd

Inherited by implicit conversion any2stringfmt from GraphLike.InnerNodeOps to StringFormat

Inherited by implicit conversion any2ArrowAssoc from GraphLike.InnerNodeOps to ArrowAssoc[GraphLike.InnerNodeOps]

Inherited by implicit conversion any2Ensuring from GraphLike.InnerNodeOps to Ensuring[GraphLike.InnerNodeOps]

Ungrouped