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] to any2stringadd[EdgeOps[N, E, This]] performed by method any2stringadd in scala.Predef.

   Definition Classes

   any2stringadd

4.  final def +~%+=[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], 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 EdgeLikeIn[X] with WLEdgeBound[_, EE], 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 EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](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 EdgeLikeIn[X] with WEdgeBound[_, EE]](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 EdgeLikeIn[X] with LHyperEdgeBound[_, EE], 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 EdgeLikeIn[X] with LEdgeBound[_, EE], 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] to ArrowAssoc[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 EdgeLikeIn[X] with LHyperEdgeBound[_, EE], 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 EdgeLikeIn[X] with LEdgeBound[_, EE], 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 EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](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 EdgeLikeIn[X] with WEdgeBound[_, EE]](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 EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], 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 EdgeLikeIn[X] with WLEdgeBound[_, EE], 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 EdgeLikeIn[X] with LHyperEdgeBound[_, EE], 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 EdgeLikeIn[X] with LEdgeBound[_, EE], 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 EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](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 EdgeLikeIn[X] with WEdgeBound[_, EE]](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 EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], 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 EdgeLikeIn[X] with WLEdgeBound[_, EE], 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[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @native() @throws( ... )

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] to Ensuring[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] to Ensuring[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] to Ensuring[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] to Ensuring[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: Any): Boolean

    Definition Classes

    AnyRef → Any

38.  def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

39.  def formatted(fmtstr: String): String

    Implicit

    This member is added by an implicit conversion from EdgeOps[N, E, This] to StringFormat[EdgeOps[N, E, This]] performed by method StringFormat in scala.Predef.

    Definition Classes

    StringFormat

    Annotations

    @inline()

40.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

41.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

42.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    AnyRef

44.  def nodesToCEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with CHyperEdgeBound[_, EE]](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[scalax.collection]

45.  def nodesToCEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with CEdgeBound[_, EE]](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[scalax.collection]

46.  final def nodesToEdge(edgeFactory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit endpointsKind: CollectionKind): GraphLike.EdgeT

    Attributes

    protected

    Annotations

    @inline()

47.  final def nodesToEdge(edgeFactory: EdgeCompanion[E], node_1: N, node_2: N): GraphLike.EdgeT

    Attributes

    protected

    Annotations

    @inline()

48.  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[scalax.collection]

49.  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[scalax.collection]

50.  final def nodesToLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](edgeFactory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*): GraphLike.EdgeT

    Attributes

    protected

    Annotations

    @inline()

51.  final def nodesToLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](edgeFactory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): GraphLike.EdgeT

    Attributes

    protected

    Annotations

    @inline()

52.  def nodesToLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], 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[scalax.collection]

53.  def nodesToLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], 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[scalax.collection]

54.  final def nodesToWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](edgeFactory: WHyperEdgeCompanion[EE], weight: Double, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): GraphLike.EdgeT

    Attributes

    protected

    Annotations

    @inline()

55.  final def nodesToWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](edgeFactory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): GraphLike.EdgeT

    Attributes

    protected

    Annotations

    @inline()

56.  def nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](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[scalax.collection]

57.  def nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](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[scalax.collection]

58.  final def nodesToWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], 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()

59.  final def nodesToWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](edgeFactory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N): GraphLike.EdgeT

    Attributes

    protected

    Annotations

    @inline()

60.  def nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], 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[scalax.collection]

61.  def nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], 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[scalax.collection]

62.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

63.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

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

    Definition Classes

    AnyRef

65.  def toString(): String

    Definition Classes

    AnyRef → Any

66.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

68.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @native() @throws( ... )

69.  def →[B](y: B): (EdgeOps[N, E, This], B)

    Implicit

    This member is added by an implicit conversion from EdgeOps[N, E, This] to ArrowAssoc[EdgeOps[N, E, This]] performed by method ArrowAssoc in scala.Predef.

    Definition Classes

    ArrowAssoc