Packages

t

scalax.collection

GraphTraversalImpl

trait GraphTraversalImpl[N, E[+X] <: EdgeLikeIn[X]] extends GraphTraversal[N, E] with TraverserImpl[N, E] with State[N, E]

Default implementation of the functionality defined by GraphTraversal except for algorithms that are placed in TraverserImpl.

Self Type
GraphTraversalImpl[N, E] with TraverserImpl[N, E]
Linear Supertypes
State[N, E], TraverserImpl[N, E], GraphTraversal[N, E], GraphBase[N, E], Serializable, AnyRef, Any
Known Subclasses
DefaultGraphImpl, DefaultGraphImpl
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphTraversalImpl
  2. State
  3. TraverserImpl
  4. GraphTraversal
  5. GraphBase
  6. Serializable
  7. AnyRef
  8. Any
Implicitly
  1. by ChainingOps
  2. by EdgeAssoc
  3. by anyToNode
  4. by any2stringadd
  5. by StringFormat
  6. by Ensuring
  7. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. trait Edge extends Serializable
    Definition Classes
    GraphBase
  2. sealed trait EdgeOrdering extends Ordering[EdgeT] with ElemOrdering
    Definition Classes
    GraphBase
  3. trait EdgeSet extends AnySet[EdgeT] with ExtSetMethods[EdgeT] with Serializable
    Definition Classes
    GraphBase
  4. sealed trait ElemOrdering extends AnyRef

    Base trait for graph Orderings.

    Base trait for graph Orderings.

    Attributes
    protected
    Definition Classes
    GraphBase
  5. trait InnerEdge extends Iterable[NodeT] with InnerEdgeParam[N, E, NodeT, E] with Edge with InnerElem
    Definition Classes
    GraphBase
  6. sealed trait InnerElem extends AnyRef
    Definition Classes
    GraphBase
  7. trait InnerNode extends InnerNodeParam[N] with Node with InnerElem
    Definition Classes
    GraphBase
  8. trait Node extends Serializable
    Definition Classes
    GraphBase
  9. sealed trait NodeOrdering extends Ordering[NodeT] with ElemOrdering

    Ordering for the path dependent type NodeT.

    Ordering for the path dependent type NodeT.

    Definition Classes
    GraphBase
  10. trait NodeSet extends AnySet[NodeT] with ExtSetMethods[NodeT]
    Definition Classes
    GraphBase
  11. sealed abstract class AbstractTopologicalOrder[+A, +T] extends AbstractIterable[T]

    Topologically ordered nodes or layers of a topological order of a graph or of an isolated graph component.

    Topologically ordered nodes or layers of a topological order of a graph or of an isolated graph component.

    A

    one of NodeT, N

    T

    one of A or (Int, Iterable[A])

    Definition Classes
    GraphTraversal
  12. abstract class Component extends Properties

    Represents a component of this graph.

    Represents a component of this graph. Edges and bridges are computed lazily. Components will be instantiated by componentTraverser or strongComponentTraverser.

    Definition Classes
    GraphTraversal
  13. trait Cycle extends Path

    Represents a cycle in this graph listing the nodes and connecting edges on it with the following syntax:

    Represents a cycle in this graph listing the nodes and connecting edges on it with the following syntax:

    cycle ::= start-end-node { edge node } edge start-end-node

    All nodes and edges on the path are distinct except the start and end nodes that are equal. A cycle contains at least a start node followed by any number of consecutive pairs of an edge and a node and the end node equaling to the start node. The first element is the start node, the second is an edge with its tail being the start node and its head being the third element etc.

    Definition Classes
    GraphTraversal
  14. trait ExtendedNodeVisitor[U] extends (NodeT) => U

    Template for extended node visitors.

    Template for extended node visitors. While the default node visitor of the type NodeT => U passes solely the inner node being visited, extended node visitors pass the following traversal state information:

    1. the inner node currently visited as with a standard node visitor
    2. the number of nodes visited so far and
    3. the current depth in terms of the underlying algorithm and
    4. a reference to a specific informer that may be pattern matched to collect even further data specific to the implementation.
    Definition Classes
    GraphTraversal
  15. abstract class FluentProperties[+This <: FluentProperties[This]] extends AnyRef

    Properties and methods for creating modified properties in a fluent-interface manner.

    Properties and methods for creating modified properties in a fluent-interface manner.

    Attributes
    protected
    Definition Classes
    GraphTraversal
  16. case class Layer(index: Int, _nodes: IndexedSeq[NodeT]) extends Product with Serializable

    Represents a topological sort layer.

    Represents a topological sort layer.

    Definition Classes
    GraphTraversal
  17. final class LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]

    Layers of a topological order of a graph or of an isolated graph component.

    Layers of a topological order of a graph or of an isolated graph component. The layers of a topological sort can roughly be defined as follows:

    1. layer 0 contains all nodes having no predecessors,
    2. layer n contains those nodes that have only predecessors in ancestor layers with at least one of them contained in layer n - 1
    A

    one of NodeT, N

    Definition Classes
    GraphTraversal
  18. trait Path extends Walk

    Represents a path in this graph where

    Represents a path in this graph where

    path ::= node { edge node }

    Nodes and edges on the path are distinct. A walk/path contains at least one node followed by any number of consecutive pairs of an edge and a node. The first element is the start node, the second is an edge with its source being the start node and its target being the third element etc.

    Definition Classes
    GraphTraversal
  19. trait Properties extends SubgraphProperties

    Properties controlling traversals.

    Properties controlling traversals.

    Attributes
    protected
    Definition Classes
    GraphTraversal
  20. trait SubgraphProperties extends AnyRef

    Properties controlling the scope of traversals.

    Properties controlling the scope of traversals.

    Attributes
    protected
    Definition Classes
    GraphTraversal
  21. final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]

    A traversable topological order of nodes of a graph or of an isolated graph component.

    A traversable topological order of nodes of a graph or of an isolated graph component.

    A

    one of NodeT, N

    Definition Classes
    GraphTraversal
  22. case class TopologicalSortFailure extends Product with Serializable

    Failure result of a topological sort with a possible hint of candidate cycle nodes.

    Failure result of a topological sort with a possible hint of candidate cycle nodes.

    Definition Classes
    GraphTraversal
  23. trait Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with CompatTraversable[A]

    Controls the properties of consecutive graph traversals starting at a root node.

    Controls the properties of consecutive graph traversals starting at a root node. Provides methods to refine the properties and to invoke traversals. Instances will be created by innerNodeTraverser etc.

    Definition Classes
    GraphTraversal
  24. trait TraverserInnerNode extends InnerNode
    Definition Classes
    GraphTraversal
  25. abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]

    The root-related methods Traverser will inherit.

    The root-related methods Traverser will inherit.

    Attributes
    protected
    Definition Classes
    GraphTraversal
  26. trait Walk extends Iterable[InnerElem]

    Represents a walk in this graph where walk ::= node { edge node } A walk/path contains at least one node followed by any number of consecutive pairs of an edge and a node.

    Represents a walk in this graph where walk ::= node { edge node } A walk/path contains at least one node followed by any number of consecutive pairs of an edge and a node. The first element is the start node, the second is an edge with its source being the start node and its target being the third element etc.

    Definition Classes
    GraphTraversal
  27. class Weight extends AnyRef

    Stores a value and an edge weight function for use in weight-based traversals that may be defined by withMaxWeight.

    Stores a value and an edge weight function for use in weight-based traversals that may be defined by withMaxWeight.

    Definition Classes
    GraphTraversal
  28. class AnyEdgeLazyCycle extends (GraphTraversalImpl.this)#AnyEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
    Attributes
    protected
  29. class AnyEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath

    LazyPath where edges are selected by taking the first one fitting.

    LazyPath where edges are selected by taking the first one fitting.

    Attributes
    protected
  30. case class ComponentTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphTraversalImpl.this)#NodeFilter, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter, ordering: (GraphTraversalImpl.this)#ElemOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight]) extends (GraphTraversalImpl.this)#ComponentTraverser with Product with Serializable
    Attributes
    protected
  31. trait DownUpTraverser[A, +This <: (GraphTraversalImpl.this)#DownUpTraverser[A, This]] extends (GraphTraversalImpl.this)#TraverserMethods[A, This] with (GraphTraversalImpl.this)#Impl[A, This]
    Attributes
    protected
  32. type EdgeFilter = ((GraphTraversalImpl.this)#EdgeT) => Boolean
    Definition Classes
    GraphBase
  33. abstract type EdgeSetT <: (GraphTraversalImpl.this)#EdgeSet
    Definition Classes
    GraphBase
  34. abstract type EdgeT <: InnerEdgeParam[N, E, (GraphTraversalImpl.this)#NodeT, E] with (GraphTraversalImpl.this)#InnerEdge with Serializable
    Definition Classes
    GraphBase
  35. case class InnerEdgeTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#InnerEdgeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#EdgeT, (GraphTraversalImpl.this)#InnerEdgeTraverser] with Product with Serializable
    Attributes
    protected
  36. case class InnerElemTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#InnerElemTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#InnerElem, (GraphTraversalImpl.this)#InnerElemTraverser] with Product with Serializable
    Attributes
    protected
  37. case class InnerNodeDownUpTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#InnerNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, (GraphTraversalImpl.this)#NodeT), (GraphTraversalImpl.this)#InnerNodeDownUpTraverser] with Product with Serializable
    Attributes
    protected
  38. trait InnerNodeTraversalImpl extends (GraphTraversalImpl.this)#TraverserInnerNode with (GraphTraversalImpl.this)#InnerNodeState
  39. case class InnerNodeTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#InnerNodeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#NodeT, (GraphTraversalImpl.this)#InnerNodeTraverser] with Product with Serializable
    Attributes
    protected
  40. type Layers = Iterable[(GraphTraversalImpl.this)#Layer]

    The result of a topological sort in the layered view.

    The result of a topological sort in the layered view.

    Definition Classes
    GraphTraversal
  41. abstract class LazyPath extends (GraphTraversalImpl.this)#Path

    Path based on the passed collection of nodes with lazy evaluation of edges.

    Path based on the passed collection of nodes with lazy evaluation of edges.

    Attributes
    protected
  42. final class MapPathTraversable[T] extends Iterable[T]

    Enables lazy traversing of a Map with key = source, value = target.

    Enables lazy traversing of a Map with key = source, value = target.

    Attributes
    protected
  43. class MinWeightEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath

    LazyPath with edges selected by minimal weight.

    LazyPath with edges selected by minimal weight.

    Attributes
    protected
  44. class MultiEdgeLazyCycle extends (GraphTraversalImpl.this)#MultiEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
    Attributes
    protected
  45. class MultiEdgeLazyPath extends (GraphTraversalImpl.this)#LazyPath

    LazyPath with edge selection such that there exists no duplicate edge in the path.

    LazyPath with edge selection such that there exists no duplicate edge in the path.

    Attributes
    protected
  46. type NodeFilter = ((GraphTraversalImpl.this)#NodeT) => Boolean
    Definition Classes
    GraphBase
  47. abstract type NodeSetT <: (GraphTraversalImpl.this)#NodeSet
    Definition Classes
    GraphBase
  48. abstract type NodeT <: (GraphTraversalImpl.this)#InnerNodeTraversalImpl
    Definition Classes
    GraphTraversalImpl → GraphTraversal → GraphBase
  49. case class OuterEdgeTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#OuterEdgeTraverser with (GraphTraversalImpl.this)#Impl[E[N], (GraphTraversalImpl.this)#OuterEdgeTraverser] with Product with Serializable
    Attributes
    protected
  50. case class OuterElemTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#TraverserMethods[OuterElem[N, E], (GraphTraversalImpl.this)#OuterElemTraverser] with (GraphTraversalImpl.this)#OuterElemTraverser with (GraphTraversalImpl.this)#Impl[OuterElem[N, E], (GraphTraversalImpl.this)#OuterElemTraverser] with Product with Serializable
    Attributes
    protected
  51. case class OuterNodeDownUpTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#OuterNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, N), (GraphTraversalImpl.this)#OuterNodeDownUpTraverser] with Product with Serializable
    Attributes
    protected
  52. case class OuterNodeTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#OuterNodeTraverser with (GraphTraversalImpl.this)#Impl[N, (GraphTraversalImpl.this)#OuterNodeTraverser] with Product with Serializable
    Attributes
    protected
  53. class PathBuilder extends (GraphTraversalImpl.this)#WalkBuilder with (GraphTraversalImpl.this)#PathBuilder
  54. final class ReverseStackTraversable[S <: NodeElement] extends Iterable[(GraphTraversalImpl.this)#NodeT]

    Efficient reverse foreach overcoming ArrayStack's deficiency not to overwrite reverseIterator.

    Efficient reverse foreach overcoming ArrayStack's deficiency not to overwrite reverseIterator.

    Attributes
    protected
  55. abstract class SimpleLazyPath extends (GraphTraversalImpl.this)#LazyPath

    LazyPath with deferred edges selection.

    LazyPath with deferred edges selection.

    Attributes
    protected
  56. class StrongComponentImpl extends (GraphTraversalImpl.this)#Component
    Attributes
    protected
  57. case class StrongComponentTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphTraversalImpl.this)#NodeFilter, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter, ordering: (GraphTraversalImpl.this)#ElemOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight]) extends (GraphTraversalImpl.this)#StrongComponentTraverser with Product with Serializable
    Attributes
    protected
  58. type TopoSortSetup = (Buffer[(GraphTraversalImpl.this)#NodeT], Map[(GraphTraversalImpl.this)#NodeT, Int])
    Attributes
    protected
  59. type TopologicalSort = Either[(GraphTraversalImpl.this)#TopologicalSortFailure, (GraphTraversalImpl.this)#TopologicalOrder[(GraphTraversalImpl.this)#NodeT]]
    Definition Classes
    GraphTraversal
  60. class WalkBuilder extends (GraphTraversalImpl.this)#WalkBuilder
  61. class WeakComponentImpl extends (GraphTraversalImpl.this)#Component
    Attributes
    protected
  62. trait InnerNodeState extends AnyRef
    Definition Classes
    State
  63. trait Impl[A, +This <: GraphTraversalImpl.Traverser[A, This] with GraphTraversalImpl.Impl[A, This]] extends GraphTraversalImpl.TraverserMethods[A, This] with GraphTraversalImpl.Traverser[A, This]
    Attributes
    protected[collection]
    Definition Classes
    TraverserImpl

Abstract Value Members

  1. abstract def edges: (GraphTraversalImpl.this)#EdgeSetT

    The edge set of this Graph commonly referred to as E(G).

    The edge set of this Graph commonly referred to as E(G).

    returns

    Set of all contained edges.

    Definition Classes
    GraphBase
  2. abstract def isDirected: Boolean

    Whether all edges of this graph are directed.

    Whether all edges of this graph are directed.

    Definition Classes
    GraphBase
  3. abstract def isHyper: Boolean

    Whether this graph contains at least one hyperedges.

    Whether this graph contains at least one hyperedges.

    Definition Classes
    GraphBase
  4. abstract def isMixed: Boolean

    Whether this graph contains at least one directed and one undirected edge.

    Whether this graph contains at least one directed and one undirected edge.

    Definition Classes
    GraphBase
  5. abstract def isMulti: Boolean

    Whether this graph contains at least one multi-edge.

    Whether this graph contains at least one multi-edge. We defnie multi-edges by

    1. two or more directed edges having the same source and target
    2. two or more undirected edges connecting the same nodes
    3. two or more (directed) hyperedges that, after being decomposed into (directed) edges, yield any multy-edge as stipulated above.
    Definition Classes
    GraphBase
  6. abstract def newEdge(innerEdge: E[(GraphTraversalImpl.this)#NodeT]): (GraphTraversalImpl.this)#EdgeT
    Attributes
    protected
    Definition Classes
    GraphBase
  7. abstract def newNode(n: N): (GraphTraversalImpl.this)#NodeT
    Attributes
    protected
    Definition Classes
    GraphBase
  8. abstract def nodes: (GraphTraversalImpl.this)#NodeSetT

    The node (vertex) set of this Graph commonly referred to as V(G).

    The node (vertex) set of this Graph commonly referred to as V(G).

    returns

    Set of all contained nodes.

    Definition Classes
    GraphBase

Concrete Value Members

  1. object Edge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  2. object EdgeOrdering extends Serializable

    Ordering for the path dependent type EdgeT.

    Ordering for the path dependent type EdgeT.

    Definition Classes
    GraphBase
  3. object EdgeT
    Definition Classes
    GraphBase
    Annotations
    @transient()
  4. object InnerEdge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  5. object InnerNode extends Serializable
    Definition Classes
    GraphBase
  6. object NoOrdering extends ElemOrdering with Serializable

    The empty ElemOrdering.

    The empty ElemOrdering.

    Definition Classes
    GraphBase
  7. object Node extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  8. object NodeOrdering extends Serializable
    Definition Classes
    GraphBase
  9. object Cycle
    Definition Classes
    GraphTraversal
  10. object ExtendedNodeVisitor
    Definition Classes
    GraphTraversal
  11. object Informer
    Definition Classes
    GraphTraversal
  12. object Path extends Serializable
    Definition Classes
    GraphTraversal
  13. object SubgraphProperties
    Attributes
    protected
    Definition Classes
    GraphTraversal
  14. object TraverserInnerNode extends Serializable
    Definition Classes
    GraphTraversal
    Annotations
    @transient()
  15. object Walk
    Definition Classes
    GraphTraversal
  16. object Weight
    Definition Classes
    GraphTraversal
  17. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  18. final def ##: Int
    Definition Classes
    AnyRef → Any
  19. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toany2stringadd[GraphTraversalImpl[N, E]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  20. def ->[B](y: B): (GraphTraversalImpl[N, E], B)
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toArrowAssoc[GraphTraversalImpl[N, E]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  21. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  22. final val anyEdge: (GraphTraversalImpl.this)#EdgeFilter

    Default edge filter letting path all edges (non-filter).

    Default edge filter letting path all edges (non-filter).

    Definition Classes
    GraphBase
  23. final def anyEdgeSelector(from: (GraphTraversalImpl.this)#NodeT, to: (GraphTraversalImpl.this)#NodeT): Option[(GraphTraversalImpl.this)#EdgeT]

    An arbitrary edge between from and to that is available most efficiently.

    An arbitrary edge between from and to that is available most efficiently.

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  24. final val anyNode: (GraphTraversalImpl.this)#NodeFilter

    Default node filter letting traverse all nodes (non-filter).

    Default node filter letting traverse all nodes (non-filter).

    Definition Classes
    GraphBase
  25. final lazy val anyOrdering: AnyOrdering[N]
    Attributes
    protected
    Definition Classes
    GraphBase
  26. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  27. def clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit
    Attributes
    protected
    Definition Classes
    State
  28. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  29. def componentTraverser(parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None): (GraphTraversalImpl.this)#ComponentTraverser

    Creates a ComponentTraverser responsible for invoking graph traversal methods in all (weakly) connected components of this possibly disconnected graph.

    Creates a ComponentTraverser responsible for invoking graph traversal methods in all (weakly) connected components of this possibly disconnected graph.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    subgraphEdges

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    ordering

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    maxWeight

    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
    GraphTraversalImpl → GraphTraversal
  30. final def cycle(results: Option[((GraphTraversalImpl.this)#NodeT, ArrayStack[CycleStackElem])], edgeFilter: (GraphTraversalImpl.this)#EdgeFilter): Option[(GraphTraversalImpl.this)#Cycle]
    Attributes
    protected
  31. final def cycle(maybeStart: Option[(GraphTraversalImpl.this)#NodeT], stack: ArrayStack[Element], edgeFilter: (GraphTraversalImpl.this)#EdgeFilter): Option[(GraphTraversalImpl.this)#Cycle]
    Attributes
    protected
  32. final lazy val defaultEdgeOrdering: (GraphTraversalImpl.this)#EdgeOrdering
    Definition Classes
    GraphBase
  33. final lazy val defaultNodeOrdering: (GraphTraversalImpl.this)#NodeOrdering
    Definition Classes
    GraphBase
  34. final def defaultPathSize: Int
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  35. def dump(store: FlagStore): ExtBitSet
    Attributes
    protected
    Definition Classes
    State
  36. def dumpDirty: ExtBitSet

    Returns a copy of the current dirty-flags for dump purposes.

    Returns a copy of the current dirty-flags for dump purposes.

    Definition Classes
    State
  37. def dumpInUse: ExtBitSet

    Returns a copy of the current inUse-flags for dump purposes.

    Returns a copy of the current inUse-flags for dump purposes.

    Definition Classes
    State
  38. implicit final def edgeToEdgeCont(e: E[N]): E[(GraphTraversalImpl.this)#NodeT]
    Attributes
    protected
    Definition Classes
    GraphBase
  39. def ensuring(cond: (GraphTraversalImpl[N, E]) => Boolean, msg: => Any): GraphTraversalImpl[N, E]
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toEnsuring[GraphTraversalImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  40. def ensuring(cond: (GraphTraversalImpl[N, E]) => Boolean): GraphTraversalImpl[N, E]
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toEnsuring[GraphTraversalImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  41. def ensuring(cond: Boolean, msg: => Any): GraphTraversalImpl[N, E]
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toEnsuring[GraphTraversalImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  42. def ensuring(cond: Boolean): GraphTraversalImpl[N, E]
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toEnsuring[GraphTraversalImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  43. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  44. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  45. final def expectedMaxNodes(divisor: Int, min: Int = 128): Int
    Attributes
    protected
  46. final def findCycle[U](implicit visitor: ((GraphTraversalImpl.this)#InnerElem) => U = empty): Option[(GraphTraversalImpl.this)#Cycle]

    Finds a cycle in this graph in any of its components and calls visitor for each inner element visited during the search.

    Finds a cycle in this graph in any of its components and calls visitor for each inner element visited during the search. See componentTraverser for more control by means of FluentProperties.

    Definition Classes
    GraphTraversal
  47. final def findCycleContaining[U](node: (GraphTraversalImpl.this)#NodeT)(implicit visitor: ((GraphTraversalImpl.this)#InnerElem) => U = empty): Option[(GraphTraversalImpl.this)#Cycle]

    Finds a cycle that contains node and calls visitor for each inner element visited during the search.

    Finds a cycle that contains node and calls visitor for each inner element visited during the search.

    Definition Classes
    GraphTraversal
  48. final def forInDegrees(nodes: Traversable[(GraphTraversalImpl.this)#NodeT] with (GraphTraversalImpl.this)#SubgraphProperties, maybeHandle: Option[Handle] = None, includeAnyway: Option[(GraphTraversalImpl.this)#NodeT] = None, includeInDegree: (GraphTraversalImpl.this)#NodeFilter = anyNode): (GraphTraversalImpl.this)#TopoSortSetup

    Calculates in-degrees of nodes spanned by nodes.

    Calculates in-degrees of nodes spanned by nodes.

    nodes

    supplies the nodes for which the degree is to be calculated

    maybeHandle

    to be used to mark visited nodes

    includeAnyway

    include this node in the resulting list of nodes without predecessors irrespective of its in degree

    includeInDegree

    optionally filters predecessor nodes when calculating the in degree

    returns

    tuple of

    1. nodes without predecessors in the component spanned by nodes
    2. map of visited nodes to their in degrees
    Attributes
    protected
  49. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  50. def graphSize: Int

    The size - commonly referred to as ||G|| - of this graph equaling to the number of edges.

    The size - commonly referred to as ||G|| - of this graph equaling to the number of edges.

    Method size is reserved for the number of nodes and edges because Graph is also SetLike with set elements being nodes or edges.

    Definition Classes
    GraphBase
  51. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  52. def initialize(nodes: Iterable[N], edges: Iterable[E[N]]): Unit

    Populates this graph with nodes and edges.

    Populates this graph with nodes and edges.

    The implementing class will typically have a constructor with the same parameters which is invoked by from of the companion object.

    nodes

    The isolated (and optionally any other) outer nodes that the node set of this graph is to be populated with.

    edges

    The outer edges that the edge set of this graph is to be populated with. Nodes being the end of any of these edges will be added to the node set.

    Attributes
    protected
    Definition Classes
    GraphBase
  53. def innerEdgeTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None): (GraphTraversalImpl.this)#InnerEdgeTraverser

    Creates a InnerEdgeTraverser based on scala.collection.Iterable[EdgeT].

    Creates a InnerEdgeTraverser based on scala.collection.Iterable[EdgeT].

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    subgraphEdges

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    ordering

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    Definition Classes
    GraphTraversalImpl → GraphTraversal
  54. def innerElemTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None): (GraphTraversalImpl.this)#InnerElemTraverser

    Creates a InnerElemTraverser based on scala.collection.Iterable[InnerElem].

    Creates a InnerElemTraverser based on scala.collection.Iterable[InnerElem].

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    subgraphEdges

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    ordering

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    maxWeight

    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
    GraphTraversalImpl → GraphTraversal
  55. def innerNodeDownUpTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None): (GraphTraversalImpl.this)#InnerNodeDownUpTraverser

    Creates a InnerNodeDownUpTraverser based on scala.collection.Iterable[(Boolean, NodeT)] where the Boolean parameter is true if the traversal takes place in downward and false if it takes place in upward direction.

    Creates a InnerNodeDownUpTraverser based on scala.collection.Iterable[(Boolean, NodeT)] where the Boolean parameter is true if the traversal takes place in downward and false if it takes place in upward direction.

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals. A kind different from DepthFirst will be ignored.

    subgraphNodes

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    subgraphEdges

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    ordering

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    maxWeight

    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
    GraphTraversalImpl → GraphTraversal
  56. def innerNodeTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None): (GraphTraversalImpl.this)#InnerNodeTraverser

    Creates a InnerNodeTraverser based on scala.collection.Iterable[NodeT].

    Creates a InnerNodeTraverser based on scala.collection.Iterable[NodeT].

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    subgraphEdges

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    ordering

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    maxWeight

    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
    GraphTraversalImpl → GraphTraversal
  57. final def isAcyclic: Boolean

    Whether this graph has no cycle.

    Whether this graph has no cycle.

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  58. def isComplete: Boolean

    Whether all nodes are pairwise adjacent.

    Whether all nodes are pairwise adjacent.

    returns

    true if this graph is complete, false if this graph contains any independent nodes.

    Definition Classes
    GraphTraversal
  59. def isConnected: Boolean

    Whether this graph is connected if it is undirected or weakly connected if it is directed.

    Whether this graph is connected if it is undirected or weakly connected if it is directed.

    Definition Classes
    GraphTraversal
  60. final def isCustomEdgeFilter(f: (GraphTraversalImpl.this)#EdgeFilter): Boolean

    true if f is not equivalent to anyEdge.

    true if f is not equivalent to anyEdge.

    Definition Classes
    GraphBase
    Annotations
    @inline()
  61. final def isCustomNodeFilter(f: (GraphTraversalImpl.this)#NodeFilter): Boolean

    true if f is not equivalent to anyNode.

    true if f is not equivalent to anyNode.

    Definition Classes
    GraphBase
    Annotations
    @inline()
  62. final def isCyclic: Boolean

    Whether this graph has at least one cycle in any of its components.

    Whether this graph has at least one cycle in any of its components.

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  63. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toOuterNode[GraphTraversalImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  64. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toOuterNode[GraphTraversalImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  65. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toOuterNode[GraphTraversalImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  66. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  67. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toOuterNode[GraphTraversalImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  68. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toOuterNode[GraphTraversalImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  69. final def isTrivial: Boolean

    true if this graph has at most 1 node.

    true if this graph has at most 1 node.

    Definition Classes
    GraphBase
    Annotations
    @inline()
  70. val n1: GraphTraversalImpl[N, E]
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toEdgeAssoc[GraphTraversalImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  71. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  72. def newPathBuilder(start: (GraphTraversalImpl.this)#NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: ((GraphTraversalImpl.this)#NodeT, (GraphTraversalImpl.this)#NodeT) => Option[(GraphTraversalImpl.this)#EdgeT]): (GraphTraversalImpl.this)#PathBuilder

    Instantiates a PathBuilder for this graph.

    Instantiates a PathBuilder for this graph.

    start

    The node this path starts at.

    sizeHint

    Expected maximum number of nodes on this path.

    edgeSelector

    Determines the edge to be selected between neighbor nodes if an edge is not supplied explicitly. This is only relevant in case of multigraphs.

    Definition Classes
    GraphTraversalImpl → GraphTraversal
  73. def newWalkBuilder(start: (GraphTraversalImpl.this)#NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: ((GraphTraversalImpl.this)#NodeT, (GraphTraversalImpl.this)#NodeT) => Option[(GraphTraversalImpl.this)#EdgeT]): (GraphTraversalImpl.this)#WalkBuilder

    Instantiates a WalkBuilder for this graph.

    Instantiates a WalkBuilder for this graph.

    start

    The node this walk starts at.

    sizeHint

    Expected maximum number of nodes on this walk.

    edgeSelector

    Determines the edge to be selected between neighbor nodes if an edge is not supplied explicitly. This is only relevant in case of multigraphs.

    Definition Classes
    GraphTraversalImpl → GraphTraversal
  74. def nextHandle: Handle

    Avoid calling this directly, prefer withHandle instead.

    Avoid calling this directly, prefer withHandle instead.

    Attributes
    protected
    Definition Classes
    State
  75. final val noNode: (GraphTraversalImpl.this)#NodeFilter

    Node predicate always returning false.

    Node predicate always returning false.

    Definition Classes
    GraphBase
  76. final def nonTrivial: Boolean

    true if this graph has at least 2 nodes.

    true if this graph has at least 2 nodes.

    Definition Classes
    GraphBase
    Annotations
    @inline()
  77. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  78. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  79. def order: Int

    The order - commonly referred to as |G| - of this graph equaling to the number of nodes.

    The order - commonly referred to as |G| - of this graph equaling to the number of nodes.

    Definition Classes
    GraphBase
  80. def outerEdgeTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None): (GraphTraversalImpl.this)#OuterEdgeTraverser

    Creates a OuterEdgeTraverser based on scala.collection.Iterable[E[N]].

    Creates a OuterEdgeTraverser based on scala.collection.Iterable[E[N]].

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    subgraphEdges

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    ordering

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    maxWeight

    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
    GraphTraversalImpl → GraphTraversal
  81. def outerElemTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None): (GraphTraversalImpl.this)#OuterElemTraverser

    Creates a OuterElemTraverser based on scala.collection.Iterable[OuterElem].

    Creates a OuterElemTraverser based on scala.collection.Iterable[OuterElem].

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    subgraphEdges

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    ordering

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    maxWeight

    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
    GraphTraversalImpl → GraphTraversal
  82. def outerNodeDownUpTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None): (GraphTraversalImpl.this)#OuterNodeDownUpTraverser

    Creates a OuterNodeDownUpTraverser based on scala.collection.Iterable[(Boolean, N)] where the Boolean parameter is true if the traversal takes place in downward and false if it takes place in upward direction.

    Creates a OuterNodeDownUpTraverser based on scala.collection.Iterable[(Boolean, N)] where the Boolean parameter is true if the traversal takes place in downward and false if it takes place in upward direction.

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals. A kind different from DepthFirst will be ignored.

    subgraphNodes

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    subgraphEdges

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    ordering

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    Definition Classes
    GraphTraversalImpl → GraphTraversal
  83. def outerNodeTraverser(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None): (GraphTraversalImpl.this)#OuterNodeTraverser

    Creates a OuterNodeTraverser based on scala.collection.Iterable[N].

    Creates a OuterNodeTraverser based on scala.collection.Iterable[N].

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    subgraphEdges

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    ordering

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    maxWeight

    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
    GraphTraversalImpl → GraphTraversal
  84. def pipe[B](f: (GraphTraversalImpl[N, E]) => B): B
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toChainingOps[GraphTraversalImpl[N, E]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  85. def productElementNames: Iterator[String]
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toOuterNode[GraphTraversalImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Product
  86. def releaseHandle(handle: Handle): Unit

    Avoid calling this directly, prefer withHandle instead.

    Avoid calling this directly, prefer withHandle instead.

    Attributes
    protected
    Definition Classes
    State
  87. val self: GraphTraversalImpl[N, E]
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toChainingOps[GraphTraversalImpl[N, E]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  88. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toOuterNode[GraphTraversalImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  89. def strongComponentTraverser(parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None): (GraphTraversalImpl.this)#StrongComponentTraverser

    Creates a StrongComponentTraverser.

    Creates a StrongComponentTraverser.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    subgraphEdges

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    ordering

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    maxWeight

    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
    GraphTraversalImpl → GraphTraversal
  90. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  91. def tap[U](f: (GraphTraversalImpl[N, E]) => U): GraphTraversalImpl[N, E]
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toChainingOps[GraphTraversalImpl[N, E]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  92. def toString(): String
    Definition Classes
    AnyRef → Any
  93. final def topologicalSort[U](implicit visitor: ((GraphTraversalImpl.this)#InnerElem) => U = empty): (GraphTraversalImpl.this)#TopologicalSort

    Sorts this graph topologically.

    Sorts this graph topologically. Hooks are ignored.

    visitor

    called for each inner node or inner edge visited during the sort. See componentTraverser for more control by means of FluentProperties.

    Definition Classes
    GraphTraversal
  94. final def topologicalSortByComponent[U](implicit visitor: ((GraphTraversalImpl.this)#InnerElem) => U = empty): Iterable[(GraphTraversalImpl.this)#TopologicalSort]

    Sorts every isolated component of this graph topologically.

    Sorts every isolated component of this graph topologically. Hooks are ignored.

    visitor

    called for each inner node or inner edge visited during the sort. See componentTraverser for more control by means of FluentProperties.

    Definition Classes
    GraphTraversal
  95. def totalWeight: Double
    Definition Classes
    GraphBase
  96. val value: GraphTraversalImpl[N, E]
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toOuterNode[GraphTraversalImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  97. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  98. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  99. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  100. def withHandle[T](reuse: Option[Handle] = None)(block: (Handle) => T): T

    Executes a code block in the context of a new or reused state handler.

    Executes a code block in the context of a new or reused state handler.

    returns

    The result of the code block executed.

    Attributes
    protected
    Definition Classes
    State
  101. def withHandles[T](nr: Int, reuse: Array[Handle] = Array.empty[Handle])(block: (Array[Handle]) => T): T

    Executes a code block in the context nr new state handlers or alternatively in the context of the state handlers reuse.

    Executes a code block in the context nr new state handlers or alternatively in the context of the state handlers reuse.

    returns

    The result of the code block executed.

    Attributes
    protected
    Definition Classes
    State
  102. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toEdgeAssoc[GraphTraversalImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  103. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toEdgeAssoc[GraphTraversalImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

Shadowed Implicit Value Members

  1. def toString(): String
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toOuterNode[GraphTraversalImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    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:
    (graphTraversalImpl: OuterNode[GraphTraversalImpl[N, E]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

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 GraphTraversalImpl[N, E] toStringFormat[GraphTraversalImpl[N, E]] 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): (GraphTraversalImpl[N, E], B)
    Implicit
    This member is added by an implicit conversion from GraphTraversalImpl[N, E] toArrowAssoc[GraphTraversalImpl[N, E]] 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 State[N, E]

Inherited from TraverserImpl[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion ChainingOps fromGraphTraversalImpl[N, E] to ChainingOps[GraphTraversalImpl[N, E]]

Inherited by implicit conversion EdgeAssoc fromGraphTraversalImpl[N, E] to EdgeAssoc[GraphTraversalImpl[N, E]]

Inherited by implicit conversion anyToNode fromGraphTraversalImpl[N, E] to OuterNode[GraphTraversalImpl[N, E]]

Inherited by implicit conversion any2stringadd fromGraphTraversalImpl[N, E] to any2stringadd[GraphTraversalImpl[N, E]]

Inherited by implicit conversion StringFormat fromGraphTraversalImpl[N, E] to StringFormat[GraphTraversalImpl[N, E]]

Inherited by implicit conversion Ensuring fromGraphTraversalImpl[N, E] to Ensuring[GraphTraversalImpl[N, E]]

Inherited by implicit conversion ArrowAssoc fromGraphTraversalImpl[N, E] to ArrowAssoc[GraphTraversalImpl[N, E]]

Ungrouped