Packages

trait EdgeOps[N, E[+X] <: EdgeLikeIn[X], +This[X, Y[+X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with Graph[X, Y[X]]] extends AnyRef

This trait contains mutating edge addition methods that don't require an outer edge. These methods are kept separately from mutable.GraphLike solely for convenience.

Self Type
GraphLike[N, E, This]
Linear Supertypes
AnyRef, Any
Known Subclasses
AdjacencyListGraph, DefaultGraphImpl, Graph, GraphLike
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EdgeOps
  2. AnyRef
  3. Any
Implicitly
  1. by ChainingOps
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. trait InnerNodeOps extends AnyRef

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 EdgeOps[N, E, This] toany2stringadd[EdgeOps[N, E, This]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. 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 = Bag): EdgeOps.this.type

    Same as addWLEdge(node_1, node_2, nodes)(weight, label) except for the returned result.

    Same as addWLEdge(node_1, node_2, nodes)(weight, label) except for the returned result.

    returns

    This mutable graph containing the hyperedge that has been created or found. to be created equals to an already existing hyperedge.

    Annotations
    @inline()
  5. final def +~%+=[EE[+X] <: E[X] with WLEdgeBound[X], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): EdgeOps.this.type

    Same as addWLEdge(node_1, node_2)(weight, label) except for the returned result.

    Same as addWLEdge(node_1, node_2)(weight, label) except for the returned result.

    returns

    This mutable graph containing the edge that has been created or found.

    Annotations
    @inline()
  6. 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 = Bag): EdgeOps.this.type

    Same as addWEdge(node_1, node_2, nodes)(weight) except for the returned result.

    Same as addWEdge(node_1, node_2, nodes)(weight) except for the returned result.

    returns

    This mutable graph containing the hyperedge that has been created or found. to be created equals to an already existing hyperedge.

    Annotations
    @inline()
  7. final def +~%=[EE[+X] <: E[X] with WEdgeBound[X]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): EdgeOps.this.type

    Same as addWEdge(node_1, node_2)(weight) except for the returned result.

    Same as addWEdge(node_1, node_2)(weight) except for the returned result.

    returns

    This mutable graph containing the edge that has been created or found.

    Annotations
    @inline()
  8. final def +~+=[EE[+X] <: E[X] with LHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): EdgeOps.this.type

    Same as addLEdge(node_1, node_2, nodes)(label) except for the returned result.

    Same as addLEdge(node_1, node_2, nodes)(label) except for the returned result.

    returns

    This mutable graph containing the hyperedge that has been created or found. to be created equals to an already existing hyperedge.

    Annotations
    @inline()
  9. final def +~+=[EE[+X] <: E[X] with LEdgeBound[X], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): EdgeOps.this.type

    Same as addLEdge(node_1, node_2)(label) except for the returned result.

    Same as addLEdge(node_1, node_2)(label) except for the returned result.

    returns

    This mutable graph containing the edge that has been created or found.

    Annotations
    @inline()
  10. final def +~=(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): EdgeOps.this.type

    Same as addEdge(node_1, node_2, nodes) except for the returned result.

    Same as addEdge(node_1, node_2, nodes) except for the returned result.

    returns

    This mutable graph containing the hyperedge that has been created or found. to be created equals to an already existing hyperedge.

    Annotations
    @inline()
  11. final def +~=(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): EdgeOps.this.type

    Same as addEdge(node_1, node_2) except for the returned result.

    Same as addEdge(node_1, node_2) except for the returned result.

    returns

    This mutable graph containing the edge that has been created or found.

    Annotations
    @inline()
  12. def ->[B](y: B): (EdgeOps[N, E, This], B)
    Implicit
    This member is added by an implicit conversion from EdgeOps[N, E, This] toArrowAssoc[EdgeOps[N, E, This]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  13. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  14. def addAndGetEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): GraphLike.EdgeT

    Same as addEdge(node_1, node_2, nodes) except for the returned result.

    Same as addEdge(node_1, node_2, nodes) except for the returned result.

    returns

    The new hyperedge or the corresponding contained hyperedge if the hyperedge to be created equals to an already existing hyperedge.

  15. final def addAndGetEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): GraphLike.EdgeT

    Same as addEdge(node_1, node_2) except for the returned result.

    Same as addEdge(node_1, node_2) except for the returned result.

    returns

    The new edge or the corresponding contained edge if the edge to be created equals to an already existing edge.

    Annotations
    @inline()
  16. 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.EdgeT

    Same as addLEdge(node_1, node_2, nodes)(label) except for the returned result.

    Same as addLEdge(node_1, node_2, nodes)(label) except for the returned result.

    returns

    The new hyperedge or the corresponding contained hyperedge if the hyperedge to be created equals to an already existing hyperedge.

  17. final def addAndGetLEdge[EE[+X] <: E[X] with LEdgeBound[X], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): GraphLike.EdgeT

    Same as addLEdge(node_1, node_2)(label) except for the returned result.

    Same as addLEdge(node_1, node_2)(label) except for the returned result.

    returns

    The new edge or the corresponding contained edge if the edge to be created equals to an already existing edge.

    Annotations
    @inline()
  18. 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 = Bag): GraphLike.EdgeT

    Same as addWEdge(node_1, node_2, nodes)(weight) except for the returned result.

    Same as addWEdge(node_1, node_2, nodes)(weight) except for the returned result.

    returns

    The new hyperedge or the corresponding contained hyperedge if the hyperedge to be created equals to an already existing hyperedge.

  19. final def addAndGetWEdge[EE[+X] <: E[X] with WEdgeBound[X]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): GraphLike.EdgeT

    Same as addWEdge(node_1, node_2)(weight) except for the returned result.

    Same as addWEdge(node_1, node_2)(weight) except for the returned result.

    returns

    The new edge or the corresponding contained edge if the edge to be created equals to an already existing edge.

    Annotations
    @inline()
  20. 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 = Bag): GraphLike.EdgeT

    Same as addWLEdge(node_1, node_2, nodes)(weight, label) except for the returned result.

    Same as addWLEdge(node_1, node_2, nodes)(weight, label) except for the returned result.

    returns

    The new hyperedge or the corresponding contained hyperedge if the hyperedge to be created equals to an already existing hyperedge.

  21. 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.EdgeT

    Same as addWLEdge(node_1, node_2)(weight, label) except for the returned result.

    Same as addWLEdge(node_1, node_2)(weight, label) except for the returned result.

    returns

    The new edge or the corresponding contained edge if the edge to be created equals to an already existing edge.

    Annotations
    @inline()
  22. final def addEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): Boolean

    Creates a new inner hyperedge between node_1, node_2 and nodes using edgeFactory and adds it to the edge set of this graph.

    Creates a new inner hyperedge between node_1, node_2 and nodes 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.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    nodes

    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()
  23. final def addEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): Boolean

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

    Creates a new inner edge between node_1 and node_2 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.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    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()
  24. 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

    Creates a new weighted and labeled inner hyperedge between node_1, node_2 and nodes using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted and labeled inner hyperedge between node_1, node_2 and nodes 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.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    nodes

    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()
  25. final def addLEdge[EE[+X] <: E[X] with LEdgeBound[X], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): Boolean

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

    Creates a new labeled inner edge between node_1 and node_2 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.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    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()
  26. 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 = Bag): Boolean

    Creates a new weighted inner hyperedge between node_1, node_2 and nodes using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted inner hyperedge between node_1, node_2 and nodes 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.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    nodes

    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()
  27. final def addWEdge[EE[+X] <: E[X] with WEdgeBound[X]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): Boolean

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

    Creates a new weighted inner edge between node_1 and node_2 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.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    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()
  28. 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 = Bag): Boolean

    Creates a new weighted and labeled inner hyperedge between node_1, node_2 and nodes using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted and labeled inner hyperedge between node_1, node_2 and nodes 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.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    nodes

    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()
  29. 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

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

    Creates a new weighted and labeled inner edge between node_1 and node_2 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.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    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()
  30. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  31. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  32. def ensuring(cond: (EdgeOps[N, E, This]) => Boolean, msg: => Any): EdgeOps[N, E, This]
    Implicit
    This member is added by an implicit conversion from EdgeOps[N, E, This] toEnsuring[EdgeOps[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  33. def ensuring(cond: (EdgeOps[N, E, This]) => Boolean): EdgeOps[N, E, This]
    Implicit
    This member is added by an implicit conversion from EdgeOps[N, E, This] toEnsuring[EdgeOps[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  34. def ensuring(cond: Boolean, msg: => Any): EdgeOps[N, E, This]
    Implicit
    This member is added by an implicit conversion from EdgeOps[N, E, This] toEnsuring[EdgeOps[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  35. def ensuring(cond: Boolean): EdgeOps[N, E, This]
    Implicit
    This member is added by an implicit conversion from EdgeOps[N, E, This] toEnsuring[EdgeOps[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  36. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  37. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  38. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  39. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  40. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  41. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  42. 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[NodeT]

    Creates a new custom inner hyperedge without modifying the node or edge set .

    Creates a new custom inner hyperedge without modifying the node or edge set .

    Attributes
    protected[collection]
  43. def nodesToCEdgeCont[EE[+X] <: E[X] with CEdgeBound[X]](factory: CEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N): E[NodeT]

    Creates a new custom inner edge without modifying the node or edge set .

    Creates a new custom inner edge without modifying the node or edge set .

    Attributes
    protected[collection]
  44. final def nodesToEdge(edgeFactory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit endpointsKind: CollectionKind): GraphLike.EdgeT
    Attributes
    protected
    Annotations
    @inline()
  45. final def nodesToEdge(edgeFactory: EdgeCompanion[E], node_1: N, node_2: N): GraphLike.EdgeT
    Attributes
    protected
    Annotations
    @inline()
  46. def nodesToEdgeCont(factory: EdgeCompanion[E], node_1: N, node_2: N): E[NodeT]

    Creates a new simple inner edge without modifying the node or edge set .

    Creates a new simple inner edge without modifying the node or edge set .

    Attributes
    protected[collection]
  47. def nodesToEdgeCont(factory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]

    Creates a new simple inner hyperedge without modifying the node or edge set .

    Creates a new simple inner hyperedge without modifying the node or edge set .

    Attributes
    protected[collection]
  48. 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.EdgeT
    Attributes
    protected
    Annotations
    @inline()
  49. final def nodesToLEdge[EE[+X] <: E[X] with LEdgeBound[X], L](edgeFactory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): GraphLike.EdgeT
    Attributes
    protected
    Annotations
    @inline()
  50. def nodesToLEdgeCont[EE[+X] <: E[X] with LEdgeBound[X], L](factory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): E[NodeT]

    Creates a new labeled inner edge without modifying the node or edge set .

    Creates a new labeled inner edge without modifying the node or edge set .

    Attributes
    protected[collection]
  51. 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 = Bag): E[NodeT]

    Creates a new labeled inner hyperedge without modifying the node or edge set .

    Creates a new labeled inner hyperedge without modifying the node or edge set .

    Attributes
    protected[collection]
  52. 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.EdgeT
    Attributes
    protected
    Annotations
    @inline()
  53. final def nodesToWEdge[EE[+X] <: E[X] with WEdgeBound[X]](edgeFactory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): GraphLike.EdgeT
    Attributes
    protected
    Annotations
    @inline()
  54. def nodesToWEdgeCont[EE[+X] <: E[X] with WEdgeBound[X]](factory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): E[NodeT]

    Creates a new weighted inner edge without modifying the node or edge set .

    Creates a new weighted inner edge without modifying the node or edge set .

    Attributes
    protected[collection]
  55. 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[NodeT]

    Creates a new weighted inner hyperedge without modifying the node or edge set .

    Creates a new weighted inner hyperedge without modifying the node or edge set .

    Attributes
    protected[collection]
  56. 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.EdgeT
    Attributes
    protected
    Annotations
    @inline()
  57. 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.EdgeT
    Attributes
    protected
    Annotations
    @inline()
  58. def nodesToWLEdgeCont[EE[+X] <: E[X] with WLEdgeBound[X], L](factory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N): E[NodeT]

    Creates a new weighted and labeled inner edge without modifying the node or edge set .

    Creates a new weighted and labeled inner edge without modifying the node or edge set .

    Attributes
    protected[collection]
  59. 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[NodeT]

    Creates a new weighted and labeled inner hyperedge without modifying the node or edge set .

    Creates a new weighted and labeled inner hyperedge without modifying the node or edge set .

    Attributes
    protected[collection]
  60. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  61. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  62. def pipe[B](f: (EdgeOps[N, E, This]) => B): B
    Implicit
    This member is added by an implicit conversion from EdgeOps[N, E, This] toChainingOps[EdgeOps[N, E, This]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  63. val self: EdgeOps[N, E, This]
    Implicit
    This member is added by an implicit conversion from EdgeOps[N, E, This] toChainingOps[EdgeOps[N, E, This]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  64. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  65. def tap[U](f: (EdgeOps[N, E, This]) => U): EdgeOps[N, E, This]
    Implicit
    This member is added by an implicit conversion from EdgeOps[N, E, This] toChainingOps[EdgeOps[N, E, This]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  66. def toString(): String
    Definition Classes
    AnyRef → Any
  67. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  68. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  69. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  2. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from EdgeOps[N, E, This] toStringFormat[EdgeOps[N, E, This]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.

  3. def →[B](y: B): (EdgeOps[N, E, This], B)
    Implicit
    This member is added by an implicit conversion from EdgeOps[N, E, This] toArrowAssoc[EdgeOps[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 AnyRef

Inherited from Any

Inherited by implicit conversion ChainingOps fromEdgeOps[N, E, This] to ChainingOps[EdgeOps[N, E, This]]

Inherited by implicit conversion any2stringadd fromEdgeOps[N, E, This] to any2stringadd[EdgeOps[N, E, This]]

Inherited by implicit conversion StringFormat fromEdgeOps[N, E, This] to StringFormat[EdgeOps[N, E, This]]

Inherited by implicit conversion Ensuring fromEdgeOps[N, E, This] to Ensuring[EdgeOps[N, E, This]]

Inherited by implicit conversion ArrowAssoc fromEdgeOps[N, E, This] to ArrowAssoc[EdgeOps[N, E, This]]

Ungrouped