abstract class Component extends Properties
Represents a component of this graph.
Edges and bridges are computed lazily.
Components will be instantiated by componentTraverser or strongComponentTraverser.
- Alphabetic
- By Inheritance
- Component
- Properties
- SubgraphProperties
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new Component()
- Attributes
- protected
Abstract Value Members
- abstract def className: String
- Attributes
- protected
- abstract def mayHaveFrontierEdges: Boolean
- Attributes
- protected
- abstract def nodes: Set[NodeT]
- abstract def ordering: GraphTraversal.ElemOrdering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- Definition Classes
- Properties
- abstract def parameters: Parameters
The properties controlling subsequent traversals.
The properties controlling subsequent traversals.
- Definition Classes
- Properties
- abstract def root: NodeT
The node where subsequent graph traversals start.
The node where subsequent graph traversals start.
- Definition Classes
- Properties
- abstract def subgraphEdges: GraphTraversal.EdgePredicate
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- Definition Classes
- SubgraphProperties
- abstract def subgraphNodes: GraphTraversal.NodePredicate
Restricts subsequent graph traversals to visit only nodes holding this predicate.
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- Definition Classes
- SubgraphProperties
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (Component, 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()
- final lazy val edges: Set[GraphTraversal.EdgeT]
- def ensuring(cond: (Component) => Boolean, msg: => Any): Component
- def ensuring(cond: (Component) => Boolean): Component
- def ensuring(cond: Boolean, msg: => Any): Component
- def ensuring(cond: Boolean): Component
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def frontierEdges(that: Component): Set[GraphTraversal.EdgeT]
- final lazy val frontierEdges: Set[GraphTraversal.EdgeT]
- 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
- def maxWeight: Option[Weight]
An optional maximum weight that limits the scope of the traversal or search.
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- Properties
- 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 synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- final def to[G[NN, EE <: Edge[NN]] <: AnyGraph[NN, EE] with GraphLike[NN, EE, G]](factory: GenericGraphCoreFactory[G]): G[N, E]
- def toString(): String
- Definition Classes
- Component → 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 Component toStringFormat[Component] 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): (Component, B)
- Implicit
- This member is added by an implicit conversion from Component toArrowAssoc[Component] 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.