Packages

t

scalax.collection.generic

GenericGraphFactory

trait GenericGraphFactory[+CC[N, E <: Edge[N]] <: AnyGraph[N, E] with GraphLike[N, E, CC]] extends Factory[CC]

Linear Supertypes
Factory[CC], AnyRef, Any
Known Subclasses
GenericGraphCoreFactory, ImmutableFactory, MutableFactory, DefaultGraphImpl, Graph, DefaultGraphImpl, Graph
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GenericGraphFactory
  2. Factory
  3. AnyRef
  4. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. type Coll = CC[_, Nothing]
    Attributes
    protected[this]
    Definition Classes
    Factory

Abstract Value Members

  1. abstract def defaultConfig: GraphConfig

    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
    Factory
  2. abstract def empty[N, E <: Edge[N]](implicit config: GraphConfig = defaultConfig): CC[N, E]

    Creates an empty Graph instance.

  3. abstract def from[N, E <: Edge[N]](nodes: Iterable[N], edges: Iterable[E])(implicit config: GraphConfig = 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.

  4. abstract def from[N, E[X] <: Edge[X]](edges: Iterable[E[N]]): CC[N, E[N]]

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 GenericGraphFactory[CC] toany2stringadd[GenericGraphFactory[CC]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (GenericGraphFactory[CC], B)
    Implicit
    This member is added by an implicit conversion from GenericGraphFactory[CC] toArrowAssoc[GenericGraphFactory[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] <: Edge[X]](elems: OuterElem[N, E[N]]*)(implicit config: GraphConfig = defaultConfig): CC[N, E[N]]

    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[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  9. final def coreConfig(config: GraphConfig): GraphConfig with AdjacencyListArrayConfig
    Attributes
    protected
    Definition Classes
    Factory
  10. def ensuring(cond: (GenericGraphFactory[CC]) => Boolean, msg: => Any): GenericGraphFactory[CC]
    Implicit
    This member is added by an implicit conversion from GenericGraphFactory[CC] toEnsuring[GenericGraphFactory[CC]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  11. def ensuring(cond: (GenericGraphFactory[CC]) => Boolean): GenericGraphFactory[CC]
    Implicit
    This member is added by an implicit conversion from GenericGraphFactory[CC] toEnsuring[GenericGraphFactory[CC]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. def ensuring(cond: Boolean, msg: => Any): GenericGraphFactory[CC]
    Implicit
    This member is added by an implicit conversion from GenericGraphFactory[CC] toEnsuring[GenericGraphFactory[CC]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. def ensuring(cond: Boolean): GenericGraphFactory[CC]
    Implicit
    This member is added by an implicit conversion from GenericGraphFactory[CC] toEnsuring[GenericGraphFactory[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: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  16. def fill[N, E <: Edge[N]](nr: Int)(elem: => OuterElem[N, E])(implicit config: GraphConfig = 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.

  17. def fromSpecific[N, E <: Edge[N]](nodes: Iterable[N], edges: Iterable[E])(implicit config: GraphConfig): CC[N, E]
    Attributes
    protected[collection]
    Definition Classes
    Factory
  18. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  19. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  20. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. def newBuilder[N, E <: Edge[N]](implicit config: GraphConfig = defaultConfig): Builder[N, E, CC]
    Definition Classes
    Factory
  23. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  24. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  25. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  26. def toString(): String
    Definition Classes
    AnyRef → Any
  27. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  28. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  29. 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
  2. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from GenericGraphFactory[CC] toStringFormat[GenericGraphFactory[CC]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.

  3. def →[B](y: B): (GenericGraphFactory[CC], B)
    Implicit
    This member is added by an implicit conversion from GenericGraphFactory[CC] toArrowAssoc[GenericGraphFactory[CC]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from Factory[CC]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd fromGenericGraphFactory[CC] to any2stringadd[GenericGraphFactory[CC]]

Inherited by implicit conversion StringFormat fromGenericGraphFactory[CC] to StringFormat[GenericGraphFactory[CC]]

Inherited by implicit conversion Ensuring fromGenericGraphFactory[CC] to Ensuring[GenericGraphFactory[CC]]

Inherited by implicit conversion ArrowAssoc fromGenericGraphFactory[CC] to ArrowAssoc[GenericGraphFactory[CC]]

Ungrouped