Packages

t

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
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphCoreCompanion
  2. GraphCompanion
  3. AnyRef
  4. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by EdgeAssoc
  4. by any2stringadd
  5. by StringFormat
  6. by Ensuring
  7. 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 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. 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
  2. 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
  3. 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
  4. def isDefined: Boolean
    Implicit
    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
  5. def isEdge: Boolean
    Implicit
    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
  6. def isIn: Boolean
    Implicit
    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
    InParamParam
  7. def isNode: Boolean
    Implicit
    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
  8. def isOut: Boolean
    Implicit
    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
    InParamParam
  9. val n1: GraphCoreCompanion[CC]
    Implicit
    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
  10. def newBuilder[N, E[X] <: EdgeLikeIn[X]](implicit edgeT: ClassTag[E[N]], config: Config): Builder[Param[N, E], CC[N, E]]
    Definition Classes
    GraphCompanion
  11. def stringPrefix: String
    Implicit
    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
  12. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from GraphCoreCompanion[CC] to CollectionsHaveToParArray[GraphCoreCompanion[CC], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (GraphCoreCompanion[CC]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  13. val value: GraphCoreCompanion[CC]
    Implicit
    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
    OuterNodeNodeParam
  14. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    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()
  15. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    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()

Shadowed Implicit Value Members

  1. def toString(): String
    Implicit
    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