class Builder[N, E <: Edge[N], +CC[N, E <: Edge[N]] <: collection.GraphLike[N, E, CC] with AnyGraph[N, E]] extends BuilderImpl[N, E]
- Alphabetic
- By Inheritance
- Builder
- BuilderImpl
- AbstractBuilder
- Growable
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new Builder(companion: Factory[CC])(implicit config: GraphConfig)
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ++=(nodes: Iterable[N] = Nil, edges: Iterable[E] = Nil): Builder.this.type
Adds all passed nodes and edges to this graph.
Adds all passed nodes and edges to this graph. For a mutable Graph see also
unionInPlace.- Definition Classes
- Growable
- def ++=(xs: Iterable[OuterElem[N, E]]): Builder.this.type
Alias for
addAll(xs).Alias for
addAll(xs).- Definition Classes
- Growable
- final def +=(edge: E): Builder.this.type
Alias for
addOne(edge).Alias for
addOne(edge).- Definition Classes
- Growable
- Annotations
- @inline()
- final def +=(node: N): Builder.this.type
Alias for
addOne(node).Alias for
addOne(node).- Definition Classes
- Growable
- Annotations
- @inline()
- def ->[B](y: B): (Builder[N, E, CC], B)
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def add(edge: E): Boolean
Adds a single edge to this graph.
Adds a single edge to this graph.
- returns
trueif this graph has not containededgebefore.
- Definition Classes
- BuilderImpl → Growable
- def add(node: N): Boolean
Adds a single node to this graph.
Adds a single node to this graph.
- returns
trueif this graph has not containednodebefore.
- Attributes
- protected
- Definition Classes
- BuilderImpl → Growable
- def addAll(xs: Iterable[OuterElem[N, E]]): Builder.this.type
Adds all elements produced by
outerto this graph.Adds all elements produced by
outerto this graph. For a graph see alsounionInPlace.- Definition Classes
- Growable
- final def addOne(edge: E): Builder.this.type
Adds a single node to this graph.
Adds a single node to this graph.
- Definition Classes
- BuilderImpl → Growable
- final def addOne(node: N): Builder.this.type
Adds a single node to this graph.
Adds a single node to this graph.
- Definition Classes
- BuilderImpl → Growable
- final def addOuter(elem: OuterElem[N, E]): Builder.this.type
Adds a single outer element to this graph.
Adds a single outer element to this graph.
- Attributes
- protected[collection]
- Definition Classes
- Growable
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clear(): Unit
- Definition Classes
- BuilderImpl → AbstractBuilder
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- val edges: ArrayBuffer[E]
- Attributes
- protected
- Definition Classes
- BuilderImpl
- def ensuring(cond: (Builder[N, E, CC]) => Boolean, msg: => Any): Builder[N, E, CC]
- def ensuring(cond: (Builder[N, E, CC]) => Boolean): Builder[N, E, CC]
- def ensuring(cond: Boolean, msg: => Any): Builder[N, E, CC]
- def ensuring(cond: Boolean): Builder[N, E, CC]
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- 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
- val nodes: ArrayBuffer[N]
- Attributes
- protected
- Definition Classes
- BuilderImpl
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def result: CC[N, E]
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def upsert(edge: E): Boolean
If an inner edge equaling to
edgeis present in this graph, it is replaced byedge, otherwiseedgewill be inserted.If an inner edge equaling to
edgeis present in this graph, it is replaced byedge, otherwiseedgewill be inserted. This is useful if non-key parts of an immutable edge are to be modified.- returns
trueifedgehas been inserted,falseif it has been replaced.
- Definition Classes
- BuilderImpl → AbstractBuilder
- 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 Builder[N, E, CC] toStringFormat[Builder[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): (Builder[N, E, CC], B)
- Implicit
- This member is added by an implicit conversion from Builder[N, E, CC] toArrowAssoc[Builder[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.