CHyperEdgeCompanion

abstract def newEdge[N](nodes: Product, attr: P): E[N] with EdgeCopy[E]

Must return an instance of the custom edge which is achieved by projecting the elements of attr and passing them as single arguments to the custom edge constructor.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (CHyperEdgeCompanion[E], B)

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def apply[N](nodes: Iterable[N], attr: P): E[N]

final def apply[N](node_1: N, node_2: N, nodes: N*)(attr: P): E[N]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def ensuring(cond: (CHyperEdgeCompanion[E]) ⇒ Boolean, msg: ⇒ Any): CHyperEdgeCompanion[E]

def ensuring(cond: (CHyperEdgeCompanion[E]) ⇒ Boolean): CHyperEdgeCompanion[E]

def ensuring(cond: Boolean, msg: ⇒ Any): CHyperEdgeCompanion[E]

def ensuring(cond: Boolean): CHyperEdgeCompanion[E]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

final def from[N](nodes: Product, attr: P): E[N]

final def getClass(): Class[_]

def hashCode(): Int

def isDefined: Boolean

def isEdge: Boolean

def isIn: Boolean

final def isInstanceOf[T0]: Boolean

def isNode: Boolean

def isOut: Boolean

val n1: CHyperEdgeCompanion[E]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def stringPrefix: String

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

def toString(): String

val value: CHyperEdgeCompanion[E]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def ~[N >: N1, N2 <: N](n2: N2): UnDiEdge[N]

def ~>[N >: N1, N2 <: N](n2: N2): DiEdge[N]

def →[B](y: B): (CHyperEdgeCompanion[E], B)

val self: Any

val self: Any

def toString(): String

def x: CHyperEdgeCompanion[E]

def x: CHyperEdgeCompanion[E]