Packages

trait InnerNodeOps extends AnyRef

Self Type
NodeT
Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InnerNodeOps
  2. AnyRef
  3. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by EdgeAssoc
  4. by ChainingOps
  5. by any2stringadd
  6. by StringFormat
  7. by Ensuring
  8. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to any2stringadd[GraphLike.InnerNodeOps] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. final def +~(that: N, those: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): GraphLike.EdgeT

    Synonym to connectWith

    Synonym to connectWith

    Annotations
    @inline()
  5. final def +~(that: N)(implicit edgeFactory: EdgeCompanion[E]): GraphLike.EdgeT

    Synonym to connectWith

    Synonym to connectWith

    Annotations
    @inline()
  6. final def +~%[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](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()
  7. final def +~%[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): GraphLike.EdgeT

    Synonym to connectWithW(that)(weight).

    Synonym to connectWithW(that)(weight).

    Annotations
    @inline()
  8. final def +~%+[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], 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()
  9. final def +~%+[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], 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()
  10. 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()
  11. 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()
  12. def ->[B](y: B): (GraphLike.InnerNodeOps, B)
    Implicit
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to ArrowAssoc[GraphLike.InnerNodeOps] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  13. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  14. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  15. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  16. 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()
  17. 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()
  18. 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()
  19. 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()
  20. final def connectWithW[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](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 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()
  21. final def connectWithW[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N)(weight: Double)(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()
  22. final def connectWithWL[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], 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 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()
  23. final def connectWithWL[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], 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 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()
  24. def ensuring(cond: (GraphLike.InnerNodeOps) ⇒ Boolean, msg: ⇒ Any): GraphLike.InnerNodeOps
    Implicit
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to Ensuring[GraphLike.InnerNodeOps] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  25. def ensuring(cond: (GraphLike.InnerNodeOps) ⇒ Boolean): GraphLike.InnerNodeOps
    Implicit
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to Ensuring[GraphLike.InnerNodeOps] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  26. def ensuring(cond: Boolean, msg: ⇒ Any): GraphLike.InnerNodeOps
    Implicit
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to Ensuring[GraphLike.InnerNodeOps] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  27. def ensuring(cond: Boolean): GraphLike.InnerNodeOps
    Implicit
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to Ensuring[GraphLike.InnerNodeOps] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  28. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  29. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  30. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  31. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to StringFormat[GraphLike.InnerNodeOps] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  32. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  33. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  34. def isDefined: Boolean
    Implicit
    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
  35. final def isEdge: Boolean
    Implicit
    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
  36. def isIn: Boolean
    Implicit
    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
    InParamParam
  37. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  38. def isNode: Boolean
    Implicit
    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
  39. final def isOut: Boolean
    Implicit
    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
  40. val n1: GraphLike.InnerNodeOps
    Implicit
    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
  41. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  42. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  43. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  44. def pipe[B](f: (GraphLike.InnerNodeOps) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to ChainingOps[GraphLike.InnerNodeOps] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  45. val self: GraphLike.InnerNodeOps
    Implicit
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to ChainingOps[GraphLike.InnerNodeOps] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  46. def stringPrefix: String
    Implicit
    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 tap[U](f: (GraphLike.InnerNodeOps) ⇒ U): GraphLike.InnerNodeOps
    Implicit
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to ChainingOps[GraphLike.InnerNodeOps] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  49. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to CollectionsHaveToParArray[GraphLike.InnerNodeOps, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (GraphLike.InnerNodeOps) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  50. def toString(): String
    Definition Classes
    AnyRef → Any
  51. val value: GraphLike.InnerNodeOps
    Implicit
    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
    OuterNodeNodeParam
  52. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  53. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  54. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  55. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    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()
  56. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    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()
  57. def [B](y: B): (GraphLike.InnerNodeOps, B)
    Implicit
    This member is added by an implicit conversion from GraphLike.InnerNodeOps to ArrowAssoc[GraphLike.InnerNodeOps] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def toString(): String
    Implicit
    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

Inherited from AnyRef

Inherited from Any

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

Inherited by implicit conversion CollectionsHaveToParArray from GraphLike.InnerNodeOps to CollectionsHaveToParArray[GraphLike.InnerNodeOps, T]

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

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

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

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

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

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

Ungrouped