Packages

class InnerOrderedHyperEdge extends OrderedHyperEdge[CC.NodeT] with CC.EdgeT

Annotations
@SerialVersionUID()
Linear Supertypes
CC.GraphInnerEdge, CC.BaseInnerEdge, CC.InnerEdge, CC.InnerElem, InnerEdgeLike[CC.NodeT], OrderedHyperEdge[CC.NodeT], OrderedEndpoints, AnyHyperEdge[CC.NodeT], EqHyper, Eq, Edge[CC.NodeT], Equals, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InnerOrderedHyperEdge
  2. GraphInnerEdge
  3. BaseInnerEdge
  4. InnerEdge
  5. InnerElem
  6. InnerEdgeLike
  7. OrderedHyperEdge
  8. OrderedEndpoints
  9. AnyHyperEdge
  10. EqHyper
  11. Eq
  12. Edge
  13. Equals
  14. AnyRef
  15. Any
Implicitly
  1. by toOuterEdge
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new InnerOrderedHyperEdge(ends: Several[CC.NodeT], outer: E)

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 CC.InnerOrderedHyperEdge toany2stringadd[CC.InnerOrderedHyperEdge] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (CC.InnerOrderedHyperEdge, B)
    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toArrowAssoc[CC.InnerOrderedHyperEdge] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def _1: CC.NodeT

    The first node of this edge.

    The first node of this edge.

    Definition Classes
    AnyHyperEdgeEdge
  7. def _2: CC.NodeT

    The second node of this edge.

    The second node of this edge.

    Definition Classes
    AnyHyperEdgeEdge
  8. def adjacents: Set[CC.EdgeT]

    All connecting edges, that is all edges with ends incident with this edge including possible loops.

    All connecting edges, that is all edges with ends incident with this edge including possible loops.

    Definition Classes
    BaseInnerEdge
  9. def arity: Int

    Number of the endpoints of this edge.

    Number of the endpoints of this edge. At least two nodes are joined. In case of a hook, the two nodes are identical. Hyperedges may link more than two nodes.

    Definition Classes
    AnyHyperEdgeEdge
  10. final def asEdgeT: CC.EdgeT
    Attributes
    protected[collection]
    Definition Classes
    GraphInnerEdgeInnerEdge
  11. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  12. def baseEquals(other: Edge[_]): Boolean
    Attributes
    protected
    Definition Classes
    EqHyperEq
  13. def baseHashCode: Int
    Attributes
    protected
    Definition Classes
    EqHyperEq
  14. def canEqual(that: Any): Boolean
    Definition Classes
    BaseInnerEdgeEdge → Equals
  15. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  16. final def containingGraph: CC.ThisGraph

    The Graph instance that contains this inner edge.

    The Graph instance that contains this inner edge.

    Definition Classes
    GraphInnerEdge
  17. final def contains[M >: CC.NodeT](node: M): Boolean

    Same as isAt.

    Same as isAt.

    Definition Classes
    Edge
    Annotations
    @inline()
  18. def customMsgPrefix: String
    Attributes
    protected
    Definition Classes
    Edge
  19. val ends: Several[CC.NodeT]

    The endpoints of this edge, in other words the nodes this edge connects.

    The endpoints of this edge, in other words the nodes this edge connects.

    Definition Classes
    InnerOrderedHyperEdgeEdge
  20. def ensuring(cond: (CC.InnerOrderedHyperEdge) => Boolean, msg: => Any): CC.InnerOrderedHyperEdge
    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toEnsuring[CC.InnerOrderedHyperEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  21. def ensuring(cond: (CC.InnerOrderedHyperEdge) => Boolean): CC.InnerOrderedHyperEdge
    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toEnsuring[CC.InnerOrderedHyperEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  22. def ensuring(cond: Boolean, msg: => Any): CC.InnerOrderedHyperEdge
    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toEnsuring[CC.InnerOrderedHyperEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  23. def ensuring(cond: Boolean): CC.InnerOrderedHyperEdge
    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toEnsuring[CC.InnerOrderedHyperEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  24. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  25. def equals(other: Any): Boolean
    Definition Classes
    BaseInnerEdge → Equals → AnyRef → Any
  26. def equals(other: Edge[_]): Boolean

    Preconditions: this.directed == that.directed && this.isInstanceOf[Keyed] == that.isInstanceOf[Keyed]

    Preconditions: this.directed == that.directed && this.isInstanceOf[Keyed] == that.isInstanceOf[Keyed]

    Attributes
    protected
    Definition Classes
    Eq
  27. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  28. def hasSource(pred: (CC.NodeT) => Boolean): Boolean

    true if any source end of this edge fulfills pred.

    true if any source end of this edge fulfills pred.

    Definition Classes
    AnyHyperEdgeEdge
  29. def hasSource[M >: CC.NodeT](node: M): Boolean

    true if node is a source of this edge.

    true if node is a source of this edge. In case this edge is undirected this method maps to isAt.

    Definition Classes
    AnyHyperEdgeEdge
  30. def hasTarget(pred: (CC.NodeT) => Boolean): Boolean

    true if any target end of this edge fulfills pred.

    true if any target end of this edge fulfills pred.

    Definition Classes
    AnyHyperEdgeEdge
  31. def hasTarget[M >: CC.NodeT](node: M): Boolean

    true if node is a target of this edge.

    true if node is a target of this edge. In case this edge is undirected this method maps to isAt.

    Definition Classes
    AnyHyperEdgeEdge
  32. def hashCode(): Int
    Definition Classes
    BaseInnerEdge → AnyRef → Any
  33. def isAt(pred: (CC.NodeT) => Boolean): Boolean

    true if any end of this edge fulfills pred.

    true if any end of this edge fulfills pred.

    Definition Classes
    AnyHyperEdgeEdge
  34. def isAt[M >: CC.NodeT](node: M): Boolean

    true if node is incident with this edge.

    true if node is incident with this edge.

    Definition Classes
    AnyHyperEdgeEdge
  35. def isDirected: Boolean

    Whether this edge is directed.

    Whether this edge is directed.

    Definition Classes
    AnyHyperEdgeEdge
  36. def isHyperEdge: Boolean

    Whether this edge's type is hyperedge meaning that it may have more than two ends.

    Whether this edge's type is hyperedge meaning that it may have more than two ends.

    Definition Classes
    AnyHyperEdgeEdge
  37. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  38. def isLabeled: Boolean
    Definition Classes
    Edge
  39. def isLooping: Boolean

    Whether this edge produces a self-loop.

    Whether this edge produces a self-loop. In case of a non-hyperedge, a loop is given if the incident nodes are equal. In case of a directed hyperedge, a loop is given if any of the targets is included in the sources. In case of an undirected hyperedge, a loop is given if any of the ends is a duplicate.

    Definition Classes
    AnyHyperEdgeEdge
  40. final def isUndirected: Boolean

    Whether this edge is undirected.

    Whether this edge is undirected.

    Definition Classes
    Edge
    Annotations
    @inline()
  41. def matches(p1: (CC.NodeT) => Boolean, p2: (CC.NodeT) => Boolean): Boolean

    true if
    a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
    b) p1 holds for a source and p2 for a target of this directed edge.

    true if
    a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
    b) p1 holds for a source and p2 for a target of this directed edge.

    Definition Classes
    AnyHyperEdgeEdge
  42. def matches[M >: CC.NodeT](n1: M, n2: M): Boolean

    true if

    true if

    1. being an undirected edge, both n1 and n2 are at this edge
    2. being a directed edge, n1 is a source and n2 a target of this edge.
    Definition Classes
    AnyHyperEdgeEdge
  43. final def matches(fList: List[(CC.NodeT) => Boolean]): Boolean
    Attributes
    protected
    Definition Classes
    AnyHyperEdge
  44. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  45. def node(n: Int): CC.NodeT

    The n'th node of this edge.

    The n'th node of this edge.

    Definition Classes
    AnyHyperEdgeEdge
    Exceptions thrown

    IllegalArgumentException if n does not meet 0 <= n < arity.

  46. final def nonHyperEdge: Boolean

    Whether this edge has exactly two ends.

    Whether this edge has exactly two ends.

    Definition Classes
    Edge
    Annotations
    @inline()
  47. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Definition Classes
    Edge
    Annotations
    @inline()
  48. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  49. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  50. val outer: E

    The outer edge as supplied by instantiation or addition.

    The outer edge as supplied by instantiation or addition.

    Definition Classes
    InnerOrderedHyperEdgeInnerEdge
  51. def privateNodes: Set[CC.NodeT]

    The nodes of this edge which only participate in this edge.

    The nodes of this edge which only participate in this edge.

    Definition Classes
    BaseInnerEdge
  52. def sources: OneOrMore[CC.NodeT]

    All source ends of this edge.

    All source ends of this edge.

    Definition Classes
    AnyHyperEdgeEdge
  53. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  54. def targets: OneOrMore[CC.NodeT]

    All target ends of this edge.

    All target ends of this edge.

    Definition Classes
    AnyHyperEdgeEdge
  55. def toString(): String
    Definition Classes
    BaseInnerEdge → AnyRef → Any
  56. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  57. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  58. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  59. final def weight: Double

    The weight of this edge with a default of 1.

    The weight of this edge with a default of 1.

    Note that weight is normally not part of the edge key (hashCode). As a result, edges with different weights connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different weights you should define a custom edge class that mixes in ExtendedKey and adds weight to keyAttributes.

    Definition Classes
    BaseInnerEdgeEdge
    Annotations
    @inline()
  60. def withSources[U](f: (CC.NodeT) => U): Unit

    Applies f to all source ends of this edge without any memory allocation.

    Applies f to all source ends of this edge without any memory allocation.

    Definition Classes
    AnyHyperEdgeEdge
  61. def withTargets[U](f: (CC.NodeT) => U): Unit

    Applies f to the target ends of this edge without any memory allocation.

    Applies f to the target ends of this edge without any memory allocation.

    Definition Classes
    AnyHyperEdgeEdge

Shadowed Implicit Value Members

  1. def arity: Int

    Number of the endpoints of this edge.

    Number of the endpoints of this edge. At least two nodes are joined. In case of a hook, the two nodes are identical. Hyperedges may link more than two nodes.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).arity
    Definition Classes
    Edge
  2. def canEqual(that: Any): Boolean
    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).canEqual(that)
    Definition Classes
    Edge → Equals
  3. final def contains[M >: CC.NodeT](node: M): Boolean

    Same as isAt.

    Same as isAt.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).contains(node)
    Definition Classes
    Edge
    Annotations
    @inline()
  4. def ends: Several[N]

    The endpoints of this edge, in other words the nodes this edge connects.

    The endpoints of this edge, in other words the nodes this edge connects.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).ends
    Definition Classes
    Edge
  5. def hasSource(pred: (N) => Boolean): Boolean

    true if any source end of this edge fulfills pred.

    true if any source end of this edge fulfills pred.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).hasSource(pred)
    Definition Classes
    Edge
  6. def hasSource[M >: CC.NodeT](node: M): Boolean

    true if node is a source of this edge.

    true if node is a source of this edge. In case this edge is undirected this method maps to isAt.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).hasSource(node)
    Definition Classes
    Edge
  7. def hasTarget(pred: (N) => Boolean): Boolean

    true if any target end of this edge fulfills pred.

    true if any target end of this edge fulfills pred.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).hasTarget(pred)
    Definition Classes
    Edge
  8. def hasTarget[M >: CC.NodeT](node: M): Boolean

    true if node is a target of this edge.

    true if node is a target of this edge. In case this edge is undirected this method maps to isAt.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).hasTarget(node)
    Definition Classes
    Edge
  9. def isAt(pred: (N) => Boolean): Boolean

    true if any end of this edge fulfills pred.

    true if any end of this edge fulfills pred.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).isAt(pred)
    Definition Classes
    Edge
  10. def isAt[M >: CC.NodeT](node: M): Boolean

    true if node is incident with this edge.

    true if node is incident with this edge.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).isAt(node)
    Definition Classes
    Edge
  11. def isDirected: Boolean

    Whether this edge is directed.

    Whether this edge is directed.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).isDirected
    Definition Classes
    Edge
  12. def isHyperEdge: Boolean

    Whether this edge's type is hyperedge meaning that it may have more than two ends.

    Whether this edge's type is hyperedge meaning that it may have more than two ends.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).isHyperEdge
    Definition Classes
    Edge
  13. def isLabeled: Boolean
    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).isLabeled
    Definition Classes
    Edge
  14. def isLooping: Boolean

    Whether this edge produces a self-loop.

    Whether this edge produces a self-loop. In case of a non-hyperedge, a loop is given if the incident nodes are equal. In case of a directed hyperedge, a loop is given if any of the targets is included in the sources. In case of an undirected hyperedge, a loop is given if any of the ends is a duplicate.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).isLooping
    Definition Classes
    Edge
  15. final def isUndirected: Boolean

    Whether this edge is undirected.

    Whether this edge is undirected.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).isUndirected
    Definition Classes
    Edge
    Annotations
    @inline()
  16. def matches(p1: (N) => Boolean, p2: (N) => Boolean): Boolean

    true if
    a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
    b) p1 holds for a source and p2 for a target of this directed edge.

    true if
    a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
    b) p1 holds for a source and p2 for a target of this directed edge.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).matches(p1, p2)
    Definition Classes
    Edge
  17. def matches[M >: CC.NodeT](n1: M, n2: M): Boolean

    true if

    true if

    1. being an undirected edge, both n1 and n2 are at this edge
    2. being a directed edge, n1 is a source and n2 a target of this edge.
    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).matches(n1, n2)
    Definition Classes
    Edge
  18. def node(n: Int): N

    The n'th node of this edge.

    The n'th node of this edge.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).node(n)
    Definition Classes
    Edge
    Exceptions thrown

    IllegalArgumentException if n does not meet 0 <= n < arity.

  19. final def nonHyperEdge: Boolean

    Whether this edge has exactly two ends.

    Whether this edge has exactly two ends.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).nonHyperEdge
    Definition Classes
    Edge
    Annotations
    @inline()
  20. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).nonLooping
    Definition Classes
    Edge
    Annotations
    @inline()
  21. def sources: OneOrMore[N]

    All source ends of this edge.

    All source ends of this edge.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).sources
    Definition Classes
    Edge
  22. def targets: OneOrMore[N]

    All target ends of this edge.

    All target ends of this edge.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).targets
    Definition Classes
    Edge
  23. def weight: Double

    The weight of this edge with a default of 1.

    The weight of this edge with a default of 1.

    Note that weight is normally not part of the edge key (hashCode). As a result, edges with different weights connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different weights you should define a custom edge class that mixes in ExtendedKey and adds weight to keyAttributes.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).weight
    Definition Classes
    Edge
  24. def withSources[U](f: (N) => U): Unit

    Applies f to all source ends of this edge without any memory allocation.

    Applies f to all source ends of this edge without any memory allocation.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).withSources(f)
    Definition Classes
    Edge
  25. def withTargets[U](f: (N) => U): Unit

    Applies f to the target ends of this edge without any memory allocation.

    Applies f to the target ends of this edge without any memory allocation.

    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
    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:
    (innerOrderedHyperEdge: E).withTargets(f)
    Definition Classes
    Edge

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 CC.InnerOrderedHyperEdge toStringFormat[CC.InnerOrderedHyperEdge] 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): (CC.InnerOrderedHyperEdge, B)
    Implicit
    This member is added by an implicit conversion from CC.InnerOrderedHyperEdge toArrowAssoc[CC.InnerOrderedHyperEdge] 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 CC.GraphInnerEdge

Inherited from CC.BaseInnerEdge

Inherited from CC.InnerEdge

Inherited from CC.InnerElem

Inherited from InnerEdgeLike[CC.NodeT]

Inherited from OrderedHyperEdge[CC.NodeT]

Inherited from OrderedEndpoints

Inherited from AnyHyperEdge[CC.NodeT]

Inherited from EqHyper

Inherited from Eq

Inherited from Edge[CC.NodeT]

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion toOuterEdge fromCC.InnerOrderedHyperEdge to E

Inherited by implicit conversion any2stringadd fromCC.InnerOrderedHyperEdge to any2stringadd[CC.InnerOrderedHyperEdge]

Inherited by implicit conversion StringFormat fromCC.InnerOrderedHyperEdge to StringFormat[CC.InnerOrderedHyperEdge]

Inherited by implicit conversion Ensuring fromCC.InnerOrderedHyperEdge to Ensuring[CC.InnerOrderedHyperEdge]

Inherited by implicit conversion ArrowAssoc fromCC.InnerOrderedHyperEdge to ArrowAssoc[CC.InnerOrderedHyperEdge]

Ungrouped