trait GraphOps[N, E <: Edge[N], +CC[X, Y <: Edge[X]] <: GraphLike[X, Y, CC] with Graph[X, Y]] extends AnyRef
Immutable graph only operations.
$define edgesOnlyUseCase Provided for the use case when you don't need to pass any isolated node.
- Alphabetic
- By Inheritance
- GraphOps
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def --(that: AnyGraph[N, E]): CC[N, E]
Creates a new graph with the elements of this graph minus the elements of
thatand edges that are incident with any node inthat. - abstract def excl(edge: E): CC[N, E]
Creates a new graph with the elements of this graph minus
edge. - abstract def excl(node: N): CC[N, E]
Creates a new graph with the elements of this graph minus
nodeand its incident edges. - abstract def incl(edge: E): CC[N, E]
Creates a new supergraph with an additional edge unless this graph already contains
edge. - abstract def incl(node: N): CC[N, E]
Creates a new supergraph with an additional node unless this graph already contains
node. - abstract def removedAll(isolatedNodes: IterableOnce[N], edges: IterableOnce[E]): CC[N, E]
Creates a new graph with the elements of this graph minus the passed elements and edges that are incident with any of the passed nodes.
Creates a new graph with the elements of this graph minus the passed elements and edges that are incident with any of the passed nodes. Use
diffto subtract all nodes and edges of another graph.- isolatedNodes
to be removed. Nodes that are implicitly defined by any edge in
edgeswill be ignored.- edges
to be removed.
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def +(edge: E): CC[N, E]
Alias for
incl(edge).Alias for
incl(edge).- Annotations
- @inline()
- final def +(node: N): CC[N, E]
Alias for
incl(node).Alias for
incl(node).- Annotations
- @inline()
- final def -(edge: E): CC[N, E]
Alias for
incl(edge).Alias for
incl(edge).- Annotations
- @inline()
- final def -(node: N): CC[N, E]
Alias for
excl(node).Alias for
excl(node).- Annotations
- @inline()
- final def --(edges: IterableOnce[E]): CC[N, E]
Alias for
removedAll(edges).Alias for
removedAll(edges).- Annotations
- @inline()
- final def --(isolatedNodes: IterableOnce[N], edges: IterableOnce[E]): CC[N, E]
Alias for
removedAll(isolatedNodes, edges).Alias for
removedAll(isolatedNodes, edges).- Annotations
- @inline()
- def ->[B](y: B): (GraphOps[N, E, CC], B)
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- 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()
- def ensuring(cond: (GraphOps[N, E, CC]) => Boolean, msg: => Any): GraphOps[N, E, CC]
- def ensuring(cond: (GraphOps[N, E, CC]) => Boolean): GraphOps[N, E, CC]
- def ensuring(cond: Boolean, msg: => Any): GraphOps[N, E, CC]
- def ensuring(cond: Boolean): GraphOps[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
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def removedAll(edges: IterableOnce[E]): CC[N, E]
Same as
removedAll(isolatedNodes, edges)but with emptyisolatedNodes.Same as
removedAll(isolatedNodes, edges)but with emptyisolatedNodes. $edgesOnlyUseCase- Annotations
- @inline()
- 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])
Shadowed Implicit Value Members
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from GraphOps[N, E, CC] toany2stringadd[GraphOps[N, E, CC]] performed by method any2stringadd in scala.Predef.
- 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:(graphOps: any2stringadd[GraphOps[N, E, CC]]).+(other)
- Definition Classes
- any2stringadd
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 GraphOps[N, E, CC] toStringFormat[GraphOps[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): (GraphOps[N, E, CC], B)
- Implicit
- This member is added by an implicit conversion from GraphOps[N, E, CC] toArrowAssoc[GraphOps[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.