Packages

class GraphMonoid[E, N] extends Monoid[Graph[E, N]]

A monoid to combine graphs.

E

edge type

N

node type

Linear Supertypes
Monoid[Graph[E, N]], Semigroup[Graph[E, N]], Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphMonoid
  2. Monoid
  3. Semigroup
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new GraphMonoid(nodeId: Identifiable[N], edgeId: Identifiable[E])

    nodeId

    the id for the new nodes

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  6. def combine(x: Graph[E, N], y: Graph[E, N]): Graph[E, N]
    Definition Classes
    GraphMonoid → Semigroup
  7. def combineAll(as: IterableOnce[Graph[E, N]]): Graph[E, N]
    Definition Classes
    Monoid
  8. def combineAllOption(as: IterableOnce[Graph[E, N]]): Option[Graph[E, N]]
    Definition Classes
    Monoid → Semigroup
  9. def combineN(a: Graph[E, N], n: Int): Graph[E, N]
    Definition Classes
    Monoid → Semigroup
  10. def empty: Graph[E, N]
    Definition Classes
    GraphMonoid → Monoid
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  13. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  14. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  15. def intercalate(middle: Graph[E, N]): Semigroup[Graph[E, N]]
    Definition Classes
    Semigroup
  16. def isEmpty(a: Graph[E, N])(implicit ev: Eq[Graph[E, N]]): Boolean
    Definition Classes
    Monoid
  17. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  18. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  20. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  21. def repeatedCombineN(a: Graph[E, N], n: Int): Graph[E, N]
    Attributes
    protected[this]
    Definition Classes
    Semigroup
  22. def reverse: Monoid[Graph[E, N]]
    Definition Classes
    Monoid → Semigroup
  23. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  24. def toString(): String
    Definition Classes
    AnyRef → Any
  25. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  26. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  27. 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

Inherited from Monoid[Graph[E, N]]

Inherited from Semigroup[Graph[E, N]]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped