Packages

t

scalax.collection.generic

MutableGraphCompanion

trait MutableGraphCompanion[+CC[N, E[X] <: EdgeLikeIn[X]] <: mutable.Graph[N, E[X]] with mutable.GraphLike[N, E[X], CC]] extends GraphCoreCompanion[CC]

Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MutableGraphCompanion
  2. GraphCoreCompanion
  3. GraphCompanion
  4. AnyRef
  5. Any
Implicitly
  1. by anyToNode
  2. by ChainingOps
  3. by CollectionsHaveToParArray
  4. by EdgeAssoc
  5. by any2stringadd
  6. by StringFormat
  7. by Ensuring
  8. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class GraphCanBuildFrom[N, E[X] <: EdgeLikeIn[X]] extends CanBuildFrom[Coll, Param[N, E], CC[N, E]]
    Definition Classes
    GraphCompanion
  2. type Coll = CC[_, Nothing]
    Attributes
    protected[this]
    Definition Classes
    GraphCompanion
  3. type Config = CoreConfig

    Type of configuration required for a specific Graph companion.

    Type of configuration required for a specific Graph companion.

    Definition Classes
    GraphCoreCompanionGraphCompanion

Abstract Value Members

  1. abstract def empty[N, E[X] <: EdgeLikeIn[X]](implicit edgeT: ClassTag[E[N]], config: Config = defaultConfig): CC[N, E]

    Creates an empty Graph instance.

    Creates an empty Graph instance.

    Definition Classes
    GraphCoreCompanionGraphCompanion
  2. abstract def from[N, E[X] <: EdgeLikeIn[X]](nodes: Traversable[N] = Nil, edges: Traversable[E[N]])(implicit edgeT: ClassTag[E[N]], config: Config = defaultConfig): CC[N, E]

    Produces a graph with a node set containing all nodes and edge ends in edges and with an edge set containing all edges but duplicates.

    Produces a graph with a node set containing all nodes and edge ends in edges and with an edge set containing all edges but duplicates. Duplicate exclusion takes place on the basis of values returned by hashCode of the supplied nodes and edges. The hash-code value of an edge is determined by its ends and optionally by other edge components such as weight or label. To include non-node edge components in the hash-code of an edge make use of any of the predefined key-weighted/key-labeled edges or mix ExtendedKey into your custom edge class.

    nodes

    the isolated and optionally any other non-isolated nodes to be included in the node set of the graph to be created.

    edges

    all edges to be included in the edge set of the graph to be created. Edge ends will be added to the node set automatically.

    returns

    A new graph instance containing nodes and all edge ends and edges.

    Definition Classes
    GraphCoreCompanionGraphCompanion

Concrete 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 MutableGraphCompanion[CC] to any2stringadd[MutableGraphCompanion[CC]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (MutableGraphCompanion[CC], B)
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to ArrowAssoc[MutableGraphCompanion[CC]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def apply[N, E[X] <: EdgeLikeIn[X]](elems: Param[N, E]*)(implicit edgeT: ClassTag[E[N]], config: Config = defaultConfig): CC[N, E]

    Creates a Graph with a node set built from all nodes in elems including edge ends and with an edge set containing all edges in elems.

    Creates a Graph with a node set built from all nodes in elems including edge ends and with an edge set containing all edges in elems. Duplicate exclusion takes place on the basis of values returned by hashCode of the supplied nodes and edges. The hash-code value of an edge is determined by its ends and optionally by other edge components such as weight or label. To include non-node edge components in the hash-code of an edge make use of any of the predefined key-weighted/key-labeled edges or mix ExtendedKey into your custom edge class.

    elems

    sequence of nodes and/or edges in an arbitrary order

    returns

    A new graph instance containing the nodes and edges derived from elems.

    Definition Classes
    GraphCoreCompanionGraphCompanion
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  9. def defaultConfig: CoreConfig

    The default configuration to be used in absence of a user-supplied configuration.

    The default configuration to be used in absence of a user-supplied configuration.

    Definition Classes
    GraphCoreCompanionGraphCompanion
  10. def ensuring(cond: (MutableGraphCompanion[CC]) ⇒ Boolean, msg: ⇒ Any): MutableGraphCompanion[CC]
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to Ensuring[MutableGraphCompanion[CC]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  11. def ensuring(cond: (MutableGraphCompanion[CC]) ⇒ Boolean): MutableGraphCompanion[CC]
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to Ensuring[MutableGraphCompanion[CC]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. def ensuring(cond: Boolean, msg: ⇒ Any): MutableGraphCompanion[CC]
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to Ensuring[MutableGraphCompanion[CC]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. def ensuring(cond: Boolean): MutableGraphCompanion[CC]
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to Ensuring[MutableGraphCompanion[CC]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  16. def fill[N, E[X] <: EdgeLikeIn[X]](nr: Int)(elem: ⇒ Param[N, E])(implicit edgeT: ClassTag[E[N]], config: Config = defaultConfig): CC[N, E]

    Produces a graph containing the results of some element computation a number of times.

    Produces a graph containing the results of some element computation a number of times. Duplicate exclusion takes place on the basis of values returned by hashCode of the supplied nodes and edges. The hash-code value of an edge is determined by its ends and optionally by other edge components such as weight or label. To include non-node edge components in the hash-code of an edge make use of any of the predefined key-weighted/key-labeled edges or mix ExtendedKey into your custom edge class.

    nr

    the number of elements to be contained in the graph.

    elem

    the element computation returning nodes or edges nr times.

    returns

    A graph that contains the results of nr evaluations of elem.

    Definition Classes
    GraphCoreCompanionGraphCompanion
  17. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to StringFormat[MutableGraphCompanion[CC]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  19. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  20. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  21. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to OuterNode[MutableGraphCompanion[CC]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  22. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to OuterNode[MutableGraphCompanion[CC]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  23. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to OuterNode[MutableGraphCompanion[CC]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  24. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  25. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to OuterNode[MutableGraphCompanion[CC]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  26. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to OuterNode[MutableGraphCompanion[CC]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  27. val n1: MutableGraphCompanion[CC]
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to EdgeAssoc[MutableGraphCompanion[CC]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  28. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  29. def newBuilder[N, E[X] <: EdgeLikeIn[X]](implicit edgeT: ClassTag[E[N]], config: Config): Builder[Param[N, E], CC[N, E]]
    Definition Classes
    MutableGraphCompanionGraphCompanion
  30. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  31. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  32. def pipe[B](f: (MutableGraphCompanion[CC]) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to ChainingOps[MutableGraphCompanion[CC]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  33. val self: MutableGraphCompanion[CC]
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to ChainingOps[MutableGraphCompanion[CC]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  34. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to OuterNode[MutableGraphCompanion[CC]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  35. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  36. def tap[U](f: (MutableGraphCompanion[CC]) ⇒ U): MutableGraphCompanion[CC]
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to ChainingOps[MutableGraphCompanion[CC]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  37. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to CollectionsHaveToParArray[MutableGraphCompanion[CC], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (MutableGraphCompanion[CC]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  38. def toString(): String
    Definition Classes
    AnyRef → Any
  39. val value: MutableGraphCompanion[CC]
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to OuterNode[MutableGraphCompanion[CC]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  40. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  41. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  42. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  43. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to EdgeAssoc[MutableGraphCompanion[CC]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  44. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to EdgeAssoc[MutableGraphCompanion[CC]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  45. def [B](y: B): (MutableGraphCompanion[CC], B)
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to ArrowAssoc[MutableGraphCompanion[CC]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def toString(): String
    Implicit
    This member is added by an implicit conversion from MutableGraphCompanion[CC] to OuterNode[MutableGraphCompanion[CC]] performed by method anyToNode in scalax.collection.GraphPredef.
    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:
    (mutableGraphCompanion: OuterNode[MutableGraphCompanion[CC]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

Inherited from GraphCoreCompanion[CC]

Inherited from GraphCompanion[CC]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from MutableGraphCompanion[CC] to OuterNode[MutableGraphCompanion[CC]]

Inherited by implicit conversion ChainingOps from MutableGraphCompanion[CC] to ChainingOps[MutableGraphCompanion[CC]]

Inherited by implicit conversion CollectionsHaveToParArray from MutableGraphCompanion[CC] to CollectionsHaveToParArray[MutableGraphCompanion[CC], T]

Inherited by implicit conversion EdgeAssoc from MutableGraphCompanion[CC] to EdgeAssoc[MutableGraphCompanion[CC]]

Inherited by implicit conversion any2stringadd from MutableGraphCompanion[CC] to any2stringadd[MutableGraphCompanion[CC]]

Inherited by implicit conversion StringFormat from MutableGraphCompanion[CC] to StringFormat[MutableGraphCompanion[CC]]

Inherited by implicit conversion Ensuring from MutableGraphCompanion[CC] to Ensuring[MutableGraphCompanion[CC]]

Inherited by implicit conversion ArrowAssoc from MutableGraphCompanion[CC] to ArrowAssoc[MutableGraphCompanion[CC]]

Ungrouped