trait TypedGraphFactory[N, E <: Edge[N], +CC[X, Y <: Edge[X]] <: AnyGraph[X, Y] with GraphLike[X, Y, CC]] extends Factory[CC]
Linear Supertypes
Known Subclasses
Type Hierarchy
Ordering
- Alphabetic
- By Inheritance
Inherited
- TypedGraphFactory
- Factory
- AnyRef
- Any
Implicitly
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- Protected
Abstract Value Members
- 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
- abstract def empty(implicit config: GraphConfig = defaultConfig): CC[N, E]
- abstract def from(nodes: Iterable[N], edges: Iterable[E])(implicit config: GraphConfig = defaultConfig): CC[N, E]
- abstract def from(edges: Iterable[E]): CC[N, E]
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from TypedGraphFactory[N, E, CC] toany2stringadd[TypedGraphFactory[N, E, CC]] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
- def ->[B](y: B): (TypedGraphFactory[N, E, CC], B)
- Implicit
- This member is added by an implicit conversion from TypedGraphFactory[N, E, CC] toArrowAssoc[TypedGraphFactory[N, E, CC]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply[NN <: N, EE <: E with Edge[NN]](elems: OuterElem[NN, EE]*)(implicit config: GraphConfig = defaultConfig): CC[NN, EE]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def coreConfig(config: GraphConfig): GraphConfig with AdjacencyListArrayConfig
- Attributes
- protected
- Definition Classes
- Factory
- def ensuring(cond: (TypedGraphFactory[N, E, CC]) => Boolean, msg: => Any): TypedGraphFactory[N, E, CC]
- Implicit
- This member is added by an implicit conversion from TypedGraphFactory[N, E, CC] toEnsuring[TypedGraphFactory[N, E, CC]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (TypedGraphFactory[N, E, CC]) => Boolean): TypedGraphFactory[N, E, CC]
- Implicit
- This member is added by an implicit conversion from TypedGraphFactory[N, E, CC] toEnsuring[TypedGraphFactory[N, E, CC]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): TypedGraphFactory[N, E, CC]
- Implicit
- This member is added by an implicit conversion from TypedGraphFactory[N, E, CC] toEnsuring[TypedGraphFactory[N, E, CC]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): TypedGraphFactory[N, E, CC]
- Implicit
- This member is added by an implicit conversion from TypedGraphFactory[N, E, CC] toEnsuring[TypedGraphFactory[N, E, CC]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def fromSpecific[N, E <: Edge[N]](nodes: Iterable[N], edges: Iterable[E])(implicit config: GraphConfig): CC[N, E]
- Attributes
- protected[collection]
- Definition Classes
- Factory
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newBuilder[N, E <: Edge[N]](implicit config: GraphConfig = defaultConfig): Builder[N, E, CC]
- Definition Classes
- Factory
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from TypedGraphFactory[N, E, CC] toStringFormat[TypedGraphFactory[N, E, 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 ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- def →[B](y: B): (TypedGraphFactory[N, E, CC], B)
- Implicit
- This member is added by an implicit conversion from TypedGraphFactory[N, E, CC] toArrowAssoc[TypedGraphFactory[N, E, 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.
Welcome to the Graph for Scala API reference. Some suggested entry points:
AnyGraphimmutable.Graphand its inner nodesmutable.Graphand its inner nodes.edgespackage and its subpackageshyperedgespackage and its subpackages.labeled edgespackagemultilabeled edgespackagelabeled hyperedgespackagemultilabeled hyperedgespackageordered labeled hyperedgespackageordered multilabeled hyperedgesobjectgenericpackage.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.