Packages

t

scalax.collection.generic

GraphCompanion

trait GraphCompanion[+CC[N, E[X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], CC]] extends AnyRef

Methods common to Graph companion objects in the core module.

CC

the kind of type of the graph that is to become the companion class/trait of the object extending this trait.

Linear Supertypes
AnyRef, Any
Known Subclasses
Graph, GraphCoreCompanion, ImmutableGraphCompanion, MutableGraphCompanion, DefaultGraphImpl, Graph, DefaultGraphImpl, Graph
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphCompanion
  2. AnyRef
  3. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Coll = CC[_, Nothing]
    Attributes
    protected[this]
  2. abstract type Config <: GraphConfig

    Type of configuration required for a specific Graph companion.

  3. class GraphCanBuildFrom[N, E[X] <: EdgeLikeIn[X]] extends CanBuildFrom[Coll, Param[N, E], CC[N, E]]

Abstract Value Members

  1. abstract def defaultConfig: Config

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

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

    Creates an empty Graph instance.

  3. abstract def from[N, E[X] <: EdgeLikeIn[X]](nodes: Traversable[N] = Nil, edges: Traversable[E[N]])(implicit edgeT: ClassTag[E[N]], config: Config): 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.

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 GraphCompanion[CC] to any2stringadd[GraphCompanion[CC]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (GraphCompanion[CC], B)
    Implicit
    This member is added by an implicit conversion from GraphCompanion[CC] to ArrowAssoc[GraphCompanion[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): 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.

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

  16. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from GraphCompanion[CC] to StringFormat[GraphCompanion[CC]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  18. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  19. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  20. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. def newBuilder[N, E[X] <: EdgeLikeIn[X]](implicit edgeT: ClassTag[E[N]], config: Config): Builder[Param[N, E], CC[N, E]]
  23. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  24. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  25. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  26. def toString(): String
    Definition Classes
    AnyRef → Any
  27. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  30. def →[B](y: B): (GraphCompanion[CC], B)
    Implicit
    This member is added by an implicit conversion from GraphCompanion[CC] to ArrowAssoc[GraphCompanion[CC]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from AnyRef

Inherited from Any

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

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

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

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

Ungrouped