scalax.collection.generic

GraphCoreCompanion

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

GraphCompanion extended to work with CoreConfig.

Linear Supertypes
GraphCompanion[CC], AnyRef, Any
Known Subclasses
DefaultGraphImpl, DefaultGraphImpl, Graph, Graph, Graph, ImmutableGraphCompanion, MutableGraphCompanion
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GraphCoreCompanion
  2. GraphCompanion
  3. AnyRef
  4. Any
Implicitly
  1. by anyToNode
  2. by EdgeAssoc
  3. by any2stringadd
  4. by any2stringfmt
  5. by any2ArrowAssoc
  6. by any2Ensuring
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. type Coll = CC[_, Nothing]

    Attributes
    protected[this]
    Definition Classes
    GraphCompanion

  2. type Config = CoreConfig

    Type of configuration required for a specific Graph companion.

    Type of configuration required for a specific Graph companion.

    Definition Classes
    GraphCoreCompanion → GraphCompanion

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

    Definition Classes
    GraphCompanion

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
    GraphCoreCompanion → GraphCompanion

  2. abstract def from[N, E[X] <: EdgeLikeIn[X]](nodes: Iterable[N] = Seq.empty[N], edges: Iterable[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
    GraphCoreCompanion → GraphCompanion

Concrete Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd

  5. def ->[B](y: B): (GraphCoreCompanion[CC], B)

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to ArrowAssoc[GraphCoreCompanion[CC]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

  6. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  7. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  8. 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
    GraphCoreCompanion → GraphCompanion

  9. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  10. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  11. 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
    GraphCoreCompanion → GraphCompanion

  12. def ensuring(cond: (GraphCoreCompanion[CC]) ⇒ Boolean, msg: ⇒ Any): GraphCoreCompanion[CC]

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to Ensuring[GraphCoreCompanion[CC]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  13. def ensuring(cond: (GraphCoreCompanion[CC]) ⇒ Boolean): GraphCoreCompanion[CC]

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to Ensuring[GraphCoreCompanion[CC]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  14. def ensuring(cond: Boolean, msg: ⇒ Any): GraphCoreCompanion[CC]

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to Ensuring[GraphCoreCompanion[CC]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  15. def ensuring(cond: Boolean): GraphCoreCompanion[CC]

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to Ensuring[GraphCoreCompanion[CC]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  16. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  17. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  18. 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
    GraphCoreCompanion → GraphCompanion

  19. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  20. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

  21. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  22. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  23. def isDefined: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to OuterNode[GraphCoreCompanion[CC]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param

  24. def isEdge: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to OuterNode[GraphCoreCompanion[CC]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

  25. def isIn: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to OuterNode[GraphCoreCompanion[CC]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param

  26. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  27. def isNode: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to OuterNode[GraphCoreCompanion[CC]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

  28. def isOut: Boolean

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to OuterNode[GraphCoreCompanion[CC]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param

  29. val n1: GraphCoreCompanion[CC]

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to EdgeAssoc[GraphCoreCompanion[CC]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc

  30. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  31. def newBuilder[N, E[X] <: EdgeLikeIn[X]](implicit edgeT: ClassTag[E[N]], config: Config): Builder[Param[N, E], CC[N, E]]

    Definition Classes
    GraphCompanion

  32. final def notify(): Unit

    Definition Classes
    AnyRef

  33. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  34. def stringPrefix: String

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to OuterNode[GraphCoreCompanion[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 toString(): String

    Definition Classes
    AnyRef → Any

  37. val value: GraphCoreCompanion[CC]

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to OuterNode[GraphCoreCompanion[CC]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam

  38. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  40. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  41. def ~[N >: N1](n2: N): UnDiEdge[N]

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to EdgeAssoc[GraphCoreCompanion[CC]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

  42. def ~>[N >: N1](n2: N): DiEdge[N]

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to EdgeAssoc[GraphCoreCompanion[CC]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

  43. def →[B](y: B): (GraphCoreCompanion[CC], B)

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to ArrowAssoc[GraphCoreCompanion[CC]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. val self: Any

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (graphCoreCompanion: StringAdd).self
    Definition Classes
    StringAdd

  2. val self: Any

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (graphCoreCompanion: StringFormat).self
    Definition Classes
    StringFormat

  3. def toString(): String

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to OuterNode[GraphCoreCompanion[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:
    (graphCoreCompanion: OuterNode[GraphCoreCompanion[CC]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

Deprecated Value Members

  1. def x: GraphCoreCompanion[CC]

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to ArrowAssoc[GraphCoreCompanion[CC]] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (graphCoreCompanion: ArrowAssoc[GraphCoreCompanion[CC]]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  2. def x: GraphCoreCompanion[CC]

    Implicit information
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to Ensuring[GraphCoreCompanion[CC]] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (graphCoreCompanion: Ensuring[GraphCoreCompanion[CC]]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from GraphCompanion[CC]

Inherited from AnyRef

Inherited from Any

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

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

Inherited by implicit conversion any2stringadd from GraphCoreCompanion[CC] to StringAdd

Inherited by implicit conversion any2stringfmt from GraphCoreCompanion[CC] to StringFormat

Inherited by implicit conversion any2ArrowAssoc from GraphCoreCompanion[CC] to ArrowAssoc[GraphCoreCompanion[CC]]

Inherited by implicit conversion any2Ensuring from GraphCoreCompanion[CC] to Ensuring[GraphCoreCompanion[CC]]

Ungrouped