Packages

class DefaultGraphImpl[N, E[+X] <: EdgeLikeIn[X]] extends Graph[N, E] with AdjacencyListGraph[N, E, DefaultGraphImpl] with GraphTraversalImpl[N, E]

Annotations
@SerialVersionUID()
Linear Supertypes
GraphTraversalImpl[N, E], State[N, E], TraverserImpl[N, E], AdjacencyListGraph[N, E, DefaultGraphImpl], AdjacencyListBase[N, E, DefaultGraphImpl], Graph[N, E], collection.Graph[N, E], GraphLike[N, E, [NN, EE[+XX]]DefaultGraphImpl[NN, EE]], GraphDegree[N, E], GraphTraversal[N, E], GraphBase[N, E], Serializable, GraphAsSet[N, E, [NN, EE[+XX]]DefaultGraphImpl[NN, EE]], Set[Param[N, E]], Equals, SetOps[Param[N, E], [_]AnySet[_], DefaultGraphImpl[N, E]], (Param[N, E]) => Boolean, Iterable[Param[N, E]], IterableFactoryDefaults[Param[N, E], [x]Set[x]], IterableOps[Param[N, E], [_]AnySet[_], DefaultGraphImpl[N, E]], IterableOnceOps[Param[N, E], [_]AnySet[_], DefaultGraphImpl[N, E]], scala.collection.IterableOnce[Param[N, E]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DefaultGraphImpl
  2. GraphTraversalImpl
  3. State
  4. TraverserImpl
  5. AdjacencyListGraph
  6. AdjacencyListBase
  7. Graph
  8. Graph
  9. GraphLike
  10. GraphDegree
  11. GraphTraversal
  12. GraphBase
  13. Serializable
  14. GraphAsSet
  15. Set
  16. Equals
  17. SetOps
  18. Function1
  19. Iterable
  20. IterableFactoryDefaults
  21. IterableOps
  22. IterableOnceOps
  23. IterableOnce
  24. AnyRef
  25. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by EdgeAssoc
  3. by predicateToNodePredicate
  4. by TraversableEnrichments
  5. by anyToNode
  6. by ChainingOps
  7. by any2stringadd
  8. by StringFormat
  9. by Ensuring
  10. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new DefaultGraphImpl(iniNodes: Iterable[N] = Set[N](), iniEdges: Iterable[E[N]] = Set[E[N]]())(implicit edgeT: ClassTag[E[N]], config: DefaultGraphImpl.Config with AdjacencyListArrayConfig)

Type Members

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

    Base trait for graph Orderings.

    Base trait for graph Orderings.

    Attributes
    protected
    Definition Classes
    GraphBase
  4. sealed trait InnerElem extends AnyRef
    Definition Classes
    GraphBase
  5. trait Node extends Serializable
    Definition Classes
    GraphBase
  6. 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
  7. trait DegreeFunction extends ((GraphDegree.this)#NodeT) => Int
    Definition Classes
    GraphDegree
  8. final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]

    Decreasing ordering of nodes with respect to their degree.

    Decreasing ordering of nodes with respect to their degree.

    Definition Classes
    GraphDegree
  9. trait Filter[T] extends (T) => Boolean
    Definition Classes
    GraphDegree
  10. class EdgeBase extends InnerEdgeParam[N, E, (GraphLike.this)#NodeT, E] with (GraphLike.this)#InnerEdge
    Definition Classes
    GraphLike
  11. trait InnerEdge extends (GraphLike.this)#InnerEdge
    Definition Classes
    GraphLike
  12. 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
  13. 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
  14. 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
  15. 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
  16. 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
  17. 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
  18. 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
  19. 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
  20. trait Properties extends SubgraphProperties

    Properties controlling traversals.

    Properties controlling traversals.

    Attributes
    protected
    Definition Classes
    GraphTraversal
  21. trait SubgraphProperties extends AnyRef

    Properties controlling the scope of traversals.

    Properties controlling the scope of traversals.

    Attributes
    protected
    Definition Classes
    GraphTraversal
  22. 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
  23. 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
  24. 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
  25. trait TraverserInnerNode extends InnerNode
    Definition Classes
    GraphTraversal
  26. 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
  27. 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
  28. 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
  29. class AnyEdgeLazyCycle extends (GraphTraversalImpl.this)#AnyEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  30. 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
    Definition Classes
    GraphTraversalImpl
  31. 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
    Definition Classes
    GraphTraversalImpl
  32. trait DownUpTraverser[A, +This <: (GraphTraversalImpl.this)#DownUpTraverser[A, This]] extends (GraphTraversalImpl.this)#TraverserMethods[A, This] with (GraphTraversalImpl.this)#Impl[A, This]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  33. 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
    Definition Classes
    GraphTraversalImpl
  34. 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
    Definition Classes
    GraphTraversalImpl
  35. 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
    Definition Classes
    GraphTraversalImpl
  36. trait InnerNodeTraversalImpl extends (GraphTraversalImpl.this)#TraverserInnerNode with (GraphTraversalImpl.this)#InnerNodeState
    Definition Classes
    GraphTraversalImpl
  37. 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
    Definition Classes
    GraphTraversalImpl
  38. 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
    Definition Classes
    GraphTraversalImpl
  39. 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
    Definition Classes
    GraphTraversalImpl
  40. class MinWeightEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath

    LazyPath with edges selected by minimal weight.

    LazyPath with edges selected by minimal weight.

    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  41. class MultiEdgeLazyCycle extends (GraphTraversalImpl.this)#MultiEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  42. 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
    Definition Classes
    GraphTraversalImpl
  43. 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
    Definition Classes
    GraphTraversalImpl
  44. 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
    Definition Classes
    GraphTraversalImpl
  45. 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
    Definition Classes
    GraphTraversalImpl
  46. 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
    Definition Classes
    GraphTraversalImpl
  47. class PathBuilder extends (GraphTraversalImpl.this)#WalkBuilder with (GraphTraversalImpl.this)#PathBuilder
    Definition Classes
    GraphTraversalImpl
  48. 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
    Definition Classes
    GraphTraversalImpl
  49. abstract class SimpleLazyPath extends (GraphTraversalImpl.this)#LazyPath

    LazyPath with deferred edges selection.

    LazyPath with deferred edges selection.

    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  50. class StrongComponentImpl extends (GraphTraversalImpl.this)#Component
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  51. 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
    Definition Classes
    GraphTraversalImpl
  52. class WalkBuilder extends (GraphTraversalImpl.this)#WalkBuilder
    Definition Classes
    GraphTraversalImpl
  53. class WeakComponentImpl extends (GraphTraversalImpl.this)#Component
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  54. trait InnerNodeState extends AnyRef
    Definition Classes
    State
  55. 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
  56. trait InnerNode extends (AdjacencyListBase.this)#InnerNode
    Definition Classes
    AdjacencyListBase
  57. class EdgeSet extends This.EdgeSet with InclExcl[This.EdgeT, Set[This.EdgeT]]
    Definition Classes
    AdjacencyListGraph
  58. abstract class InnerNodeImpl extends This.NodeBase with This.InnerNode
    Definition Classes
    AdjacencyListGraph
  59. class NodeSet extends This.NodeSet
    Definition Classes
    AdjacencyListGraph
  60. type Config = CoreConfig
    Attributes
    protected
    Definition Classes
    DefaultGraphImplAdjacencyListBaseGraphLike
  61. type DegreeNodeSeqEntry = (Int, NodeT)

    Type alias for entries in degree maps returned by degreeSeqMap.

    Type alias for entries in degree maps returned by degreeSeqMap.

    Definition Classes
    GraphDegree
  62. type EdgeFilter = (EdgeT) => Boolean
    Definition Classes
    GraphBase
  63. type EdgeSetT = EdgeSet
  64. type EdgeT = EdgeBase
    Definition Classes
    AdjacencyListGraphGraphLikeGraphBase
  65. type Layers = Iterable[Layer]

    The result of a topological sort in the layered view.

    The result of a topological sort in the layered view.

    Definition Classes
    GraphTraversal
  66. final class NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl
    Attributes
    protected
    Annotations
    @SerialVersionUID()
  67. type NodeFilter = (NodeT) => Boolean
    Definition Classes
    GraphBase
  68. type NodeSetT = NodeSet
  69. type NodeT = NodeBase
  70. type ThisGraph = DefaultGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
  71. type TopoSortSetup = (Buffer[NodeT], Map[NodeT, Int])
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  72. type TopologicalSort = Either[TopologicalSortFailure, TopologicalOrder[NodeT]]
    Definition Classes
    GraphTraversal

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 Degree extends (GraphDegree.this)#DegreeFunction
    Definition Classes
    GraphDegree
  10. object DegreeOrdering extends Serializable
    Definition Classes
    GraphDegree
  11. object InDegree extends (GraphDegree.this)#DegreeFunction
    Definition Classes
    GraphDegree
  12. object IntReverseOrdering extends Ordering[Int]

    Decreasing ordering of integers.

    Decreasing ordering of integers.

    Definition Classes
    GraphDegree
  13. object OutDegree extends (GraphDegree.this)#DegreeFunction
    Definition Classes
    GraphDegree
  14. object Cycle
    Definition Classes
    GraphTraversal
  15. object ExtendedNodeVisitor
    Definition Classes
    GraphTraversal
  16. object Informer
    Definition Classes
    GraphTraversal
  17. object Path extends Serializable
    Definition Classes
    GraphTraversal
  18. object SubgraphProperties
    Attributes
    protected
    Definition Classes
    GraphTraversal
  19. object TraverserInnerNode extends Serializable
    Definition Classes
    GraphTraversal
    Annotations
    @transient()
  20. object Walk
    Definition Classes
    GraphTraversal
  21. object Weight
    Definition Classes
    GraphTraversal
  22. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  23. final def ##: Int
    Definition Classes
    AnyRef → Any
  24. final def &(that: Set[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  25. final def &~(that: Set[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  26. def +(n: N): DefaultGraphImpl[N, E]

    Creates a new supergraph with an additional node, unless the node passed is already present.

    Creates a new supergraph with an additional node, unless the node passed is already present.

    returns

    the new supergraph containing all nodes and edges of this graph and node additionally.

    Definition Classes
    AdjacencyListGraphGraphLike
  27. final def +#(e: E[N]): DefaultGraphImpl[N, E]

    Creates a new supergraph with an additional edge, unless the edge passed is already present.

    Creates a new supergraph with an additional edge, unless the edge passed is already present.

    returns

    the new supergraph containing all nodes and edges of this graph plus edge.

    Attributes
    protected
    Definition Classes
    DefaultGraphImplGraphLike
  28. final def ++(that: scala.collection.IterableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  29. final def ++[B >: Param[N, E]](suffix: scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  30. def -(n: N): DefaultGraphImpl[N, E]

    Creates a new subgraph consisting of all nodes and edges of this graph except node and those edges which node is incident with.

    Creates a new subgraph consisting of all nodes and edges of this graph except node and those edges which node is incident with.

    returns

    the new subgraph of this graph after the "ripple" deletion of node.

    Definition Classes
    AdjacencyListGraphGraphLike
  31. def -!#(e: E[N]): DefaultGraphImpl[N, E]

    Creates a new subgraph consisting of all nodes and edges of this graph except edge and those nodes which are incident with edge and would become edge-less after deletion.

    Creates a new subgraph consisting of all nodes and edges of this graph except edge and those nodes which are incident with edge and would become edge-less after deletion.

    returns

    a new subgraph of this graph after the "ripple" deletion of edge from this graph.

    Attributes
    protected
    Definition Classes
    AdjacencyListGraphGraphLike
  32. def -#(e: E[N]): DefaultGraphImpl[N, E]

    Creates a new subgraph consisting of all nodes and edges of this graph except edge.

    Creates a new subgraph consisting of all nodes and edges of this graph except edge. The node set remains unchanged.

    returns

    a new subgraph of this graph that contains all nodes and edges of this graph except of edge.

    Attributes
    protected
    Definition Classes
    DefaultGraphImplGraphLike
  33. def --(elems: IterableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphAsSet → SetOps
  34. def ->[B](y: B): (DefaultGraphImpl[N, E], B)
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toArrowAssoc[DefaultGraphImpl[N, E]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  35. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  36. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  37. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  38. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  39. def andThen[A](g: (Boolean) => A): (Param[N, E]) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  40. final val anyEdge: EdgeFilter

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

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

    Definition Classes
    GraphBase
  41. final def anyEdgeSelector(from: NodeT, to: NodeT): Option[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()
  42. final val anyNode: NodeFilter

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

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

    Definition Classes
    GraphBase
  43. final lazy val anyOrdering: AnyOrdering[N]
    Attributes
    protected
    Definition Classes
    GraphBase
  44. final def apply(elem: Param[N, E]): Boolean
    Definition Classes
    SetOps → Function1
    Annotations
    @inline()
  45. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  46. def asSortedString(nodeSeparator: String = GraphBase.defaultSeparator, edgeSeparator: String = GraphBase.defaultSeparator, nodesEdgesSeparator: String = GraphBase.defaultSeparator, withNodesEdgesPrefix: Boolean = false)(implicit ordNode: NodeOrdering = defaultNodeOrdering, ordEdge: EdgeOrdering = defaultEdgeOrdering): String

    Sorts all nodes of this graph by ordNode followed by all edges sorted by ordEdge and concatinates their string representation nodeSeparator and edgeSeparator respectively.

    Sorts all nodes of this graph by ordNode followed by all edges sorted by ordEdge and concatinates their string representation nodeSeparator and edgeSeparator respectively.

    nodeSeparator

    to separate nodes by.

    edgeSeparator

    to separate edges by.

    nodesEdgesSeparator

    to separate nodes from edges by.

    withNodesEdgesPrefix

    whether the node and edge set should be prefixed.

    ordNode

    the node ordering defaulting to defaultNodeOrdering.

    ordEdge

    the edge ordering defaulting to defaultEdgeOrdering.

    Definition Classes
    GraphLike
  47. final def bulkOp(elems: IterableOnce[Param[N, E]], isPlusPlus: Boolean): DefaultGraphImpl[N, E]

    Prepares and calls plusPlus or minusMinus.

    Prepares and calls plusPlus or minusMinus.

    Attributes
    protected
    Definition Classes
    GraphLike → GraphAsSet
  48. def canEqual(that: Any): Boolean
    Definition Classes
    Set → Equals
  49. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  50. def clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit
    Attributes
    protected
    Definition Classes
    State
  51. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  52. final def coll: DefaultGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  53. def collect[B](pf: PartialFunction[Param[N, E], B]): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  54. def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
    Definition Classes
    IterableOnceOps
  55. def componentTraverser(parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): 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
    GraphTraversalImplGraphTraversal
  56. def compose[A](g: (A) => Param[N, E]): (A) => Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  57. def concat(elems: IterableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphAsSet → SetOps
  58. def concat[B >: Param[N, E]](suffix: scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps
  59. implicit val config: DefaultGraphImpl.Config with AdjacencyListArrayConfig
    Definition Classes
    DefaultGraphImplGraphLike
  60. def contains(elem: Param[N, E]): Boolean

    Checks whether a given node or edge is contained in this graph.

    Checks whether a given node or edge is contained in this graph.

    elem

    the node or edge the existence of which is to be checked

    returns

    true if elem is contained in this graph

    Definition Classes
    GraphLike → SetOps
  61. final def copy(nodes: Iterable[N], edges: Iterable[E[N]]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    DefaultGraphImplAdjacencyListGraph
  62. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  63. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  64. def copyToArray[B >: Param[N, E]](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  65. def corresponds[B](that: scala.collection.IterableOnce[B])(p: (Param[N, E], B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  66. def count(p: (Param[N, E]) => Boolean): Int
    Definition Classes
    IterableOnceOps
  67. final def cycle(results: Option[(NodeT, ArrayStack[CycleStackElem])], edgeFilter: EdgeFilter): Option[Cycle]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  68. final def cycle(maybeStart: Option[NodeT], stack: ArrayStack[Element], edgeFilter: EdgeFilter): Option[Cycle]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  69. final lazy val defaultEdgeOrdering: EdgeOrdering
    Definition Classes
    GraphBase
  70. final lazy val defaultNodeOrdering: NodeOrdering
    Definition Classes
    GraphBase
  71. final def defaultPathSize: Int
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  72. def degreeCount(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): SortedMap[Int, Int]

    The degree set of this graph projected onto a map.

    The degree set of this graph projected onto a map. The keys of the map are the degrees in decreasing order while the values are the number of inner nodes having the degree of the corresponding key.

    Definition Classes
    GraphDegree
  73. def degreeNodeSeq(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Seq[DegreeNodeSeqEntry]

    The degree sequence of this graph projected onto a sequence of tuples.

    The degree sequence of this graph projected onto a sequence of tuples. The first elements of the tuples are the degrees in non-increasing order while the second elements are the corresponding inner nodes.

    Definition Classes
    GraphDegree
  74. def degreeNodesMap(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): SortedMap[Int, AnySet[NodeT]]

    The degree set of this graph projected onto a map.

    The degree set of this graph projected onto a map. The keys of the map are the degrees in decreasing order while the values are sets of the corresponding inner nodes.

    Definition Classes
    GraphDegree
  75. def degreeSeq(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Seq[Int]

    The degree sequence of this graph, that is the non-increasing sequence of degrees over all nodes.

    The degree sequence of this graph, that is the non-increasing sequence of degrees over all nodes.

    Definition Classes
    GraphDegree
  76. def degreeSet(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): SortedSet[Int]

    The degree set of this graph, that is the decreasing set of unique degrees over all nodes.

    The degree set of this graph, that is the decreasing set of unique degrees over all nodes. Same as degreeSeq without duplicates.

    Definition Classes
    GraphDegree
  77. def diff(that: AnySet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphAsSet → SetOps
  78. def drop(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  79. def dropRight(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps
  80. def dropWhile(p: (Param[N, E]) => Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  81. def dump(store: FlagStore): ExtBitSet
    Attributes
    protected
    Definition Classes
    State
  82. 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
  83. 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
  84. def edgeIterator: Iterator[EdgeT]
    Definition Classes
    AdjacencyListBase
  85. implicit val edgeT: ClassTag[E[N]]
    Definition Classes
    DefaultGraphImplGraphLike
  86. implicit final def edgeToEdgeCont(e: E[N]): E[NodeT]
    Attributes
    protected
    Definition Classes
    GraphBase
  87. final def edges: 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
    DefaultGraphImplAdjacencyListGraphGraphBase
    Annotations
    @inline()
  88. final def empty: DefaultGraphImpl[N, E]
    Definition Classes
    DefaultGraphImplGraphGraph → GraphAsSet → IterableFactoryDefaults → IterableOps
  89. def ensuring(cond: (DefaultGraphImpl[N, E]) => Boolean, msg: => Any): DefaultGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toEnsuring[DefaultGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  90. def ensuring(cond: (DefaultGraphImpl[N, E]) => Boolean): DefaultGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toEnsuring[DefaultGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  91. def ensuring(cond: Boolean, msg: => Any): DefaultGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toEnsuring[DefaultGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  92. def ensuring(cond: Boolean): DefaultGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toEnsuring[DefaultGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  93. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  94. def equals(that: Any): Boolean

    Graph instances are equal if their nodes and edges turned to outer nodes and outer edges are equal.

    Graph instances are equal if their nodes and edges turned to outer nodes and outer edges are equal. Any TraversableOnce instance may also be equal to this graph if its set representation contains equalling outer nodes and outer edges. Thus the following expressions hold:

    Graph(1~2, 3) == List(1~2, 3)
    Graph(1~2, 3) == List(1, 2, 2, 3, 2~1)

    The first test is false because of the failing nodes 1 and 2. The second is true because of duplicate elimination and undirected edge equivalence.

    Definition Classes
    GraphLike → Set → Equals → AnyRef → Any
  95. def excl(elem: Param[N, E]): DefaultGraphImpl[N, E]

    Creates a new subgraph consisting of all nodes and edges of this graph except elem.

    Creates a new subgraph consisting of all nodes and edges of this graph except elem. If elem is of type N, this method maps to -(node: N). Otherwise the edge is deleted leaving the node set unchanged.

    elem

    node or edge to be removed.

    returns

    the new subgraph of this graph after the "ripple" deletion of the passed node or the simple deletion of the passed edge.

    Definition Classes
    GraphLike
  96. def exists(p: (Param[N, E]) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  97. final def expectedMaxNodes(divisor: Int, min: Int = 128): Int
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  98. def filter(pred: (Param[N, E]) => Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  99. def filterNot(pred: (Param[N, E]) => Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  100. final def find(outerEdge: E[N]): Option[EdgeT]

    Searches for an edge node equaling to outerEdge in this graph.

    Searches for an edge node equaling to outerEdge in this graph.

    outerEdge

    the outer edge to search for in this graph.

    returns

    Some of the inner edge found or None.

    Definition Classes
    GraphLike
    Annotations
    @inline()
  101. final def find(outerNode: N): Option[NodeT]

    Searches for an inner node equaling to outerNode in this graph.

    Searches for an inner node equaling to outerNode in this graph.

    outerNode

    the outer node to search for in this graph.

    returns

    Some of the inner node found or None.

    Definition Classes
    GraphLike
    Annotations
    @inline()
  102. def find(p: (Param[N, E]) => Boolean): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  103. final def findCycle[U](implicit visitor: (InnerElem) => U = empty): Option[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
  104. final def findCycleContaining[U](node: NodeT)(implicit visitor: (InnerElem) => U = empty): Option[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
  105. def flatMap[B](f: (Param[N, E]) => scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  106. def flatten[B](implicit asIterable: (Param[N, E]) => scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  107. def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  108. def foldLeft[B](z: B)(op: (B, Param[N, E]) => B): B
    Definition Classes
    IterableOnceOps
  109. def foldRight[B](z: B)(op: (Param[N, E], B) => B): B
    Definition Classes
    IterableOnceOps
  110. final def forInDegrees(nodes: Traversable[NodeT] with SubgraphProperties, maybeHandle: Option[Handle] = None, includeAnyway: Option[NodeT] = None, includeInDegree: NodeFilter = anyNode): 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
    Definition Classes
    GraphTraversalImpl
  111. def forall(p: (Param[N, E]) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  112. def foreach[U](f: (Param[N, E]) => U): Unit
    Definition Classes
    IterableOnceOps
  113. def fromSpecific(coll: IterableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
    Attributes
    protected
    Definition Classes
    GraphAsSet → IterableFactoryDefaults → IterableOps
  114. final def get(outerEdge: E[N]): EdgeT

    Searches for an inner edge equaling to outerEdge in this graph which must exist in this graph.

    Searches for an inner edge equaling to outerEdge in this graph which must exist in this graph.

    outerEdge

    the outer edge to search for in this graph.

    returns

    the inner edge if found. Otherwise NoSuchElementException is thrown.

    Definition Classes
    GraphLike
    Annotations
    @inline()
  115. final def get(outerNode: N): NodeT

    Searches for an inner node equaling to outerNode in this graph which must exist in this graph.

    Searches for an inner node equaling to outerNode in this graph which must exist in this graph.

    outerNode

    the outer node to search for in this graph.

    returns

    the inner node if found. Otherwise NoSuchElementException is thrown.

    Definition Classes
    GraphLike
    Annotations
    @inline()
  116. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  117. final def getOrElse(outerEdge: E[N], default: EdgeT): EdgeT

    Searches for an inner edge equaling to outerEdge in this graph.

    Searches for an inner edge equaling to outerEdge in this graph.

    outerEdge

    the outer edge to search for in this graph.

    default

    the inner edge to return if outerEdge cannot be found.

    returns

    the inner edge looked up or default if no inner edge equaling to edge could be found.

    Definition Classes
    GraphLike
    Annotations
    @inline()
  118. final def getOrElse(outerNode: N, default: NodeT): NodeT

    Searches for an inner node equaling to outerNode in this graph.

    Searches for an inner node equaling to outerNode in this graph.

    outerNode

    the outer node to search for in this graph.

    default

    the inner node to return if outerNode is not contained.

    returns

    The inner node looked up or default if no inner node equaling to outerNode could be found.

    Definition Classes
    GraphLike
    Annotations
    @inline()
  119. final val graphCompanion: DefaultGraphImpl.type

    The companion object of This.

    The companion object of This.

    Definition Classes
    DefaultGraphImpl → GraphAsSet
  120. 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
  121. def groupBy[K](f: (Param[N, E]) => K): Map[K, DefaultGraphImpl[N, E]]
    Definition Classes
    IterableOps
  122. def groupMap[K, B](key: (Param[N, E]) => K)(f: (Param[N, E]) => B): Map[K, AnySet[B]]
    Definition Classes
    IterableOps
  123. def groupMapReduce[K, B](key: (Param[N, E]) => K)(f: (Param[N, E]) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  124. def grouped(size: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableOps
  125. def hashCode(): Int
    Definition Classes
    Set → AnyRef → Any
  126. def having(node: NodeFilter = _ => false, edge: EdgeFilter = null): PartialFunction[Param[N, E], Boolean]

    Provides a shortcut for predicates involving any graph element.

    Provides a shortcut for predicates involving any graph element. In order to compute a subgraph of this graph, the result of this method may be passed to any graph-level method requiring a predicate such as count, exists, filter, filterNot, forall etc. For instance

    val g = Graph(2~>3, 3~>1, 5)
    g filter g.having(nodes = _ >= 2) // yields Graph(2, 3, 5, 2~>3)
    node

    The predicate that must hold for the nodes.

    edge

    The predicate that must hold for the edges. If omitted, all edges between nodes to be included by nodes will also be included.

    returns

    A partial function combining the passed predicates.

    Definition Classes
    GraphLike
  127. def head: Param[N, E]
    Definition Classes
    IterableOps
  128. def headOption: Option[Param[N, E]]
    Definition Classes
    IterableOps
  129. def incl(elem: Param[N, E]): DefaultGraphImpl[N, E]

    Creates a new supergraph with an additional node or edge, unless the node or edge passed is already present.

    Creates a new supergraph with an additional node or edge, unless the node or edge passed is already present.

    This method purely wraps +(node: N) respectively +#(edge: E[N]) granting the same behavior.

    elem

    the wrapped node or edge to be added; if elem is of type N, the wrapped object is added to the node set otherwise to the edge set.

    returns

    a new supergraph containing all nodes and edges of this graph plus elem.

    Definition Classes
    GraphLike
  130. def init: DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps
  131. 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
  132. def initializeFrom(in: ObjectInputStream, nodes: NodeSetT, edges: EdgeSetT): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  133. def inits: Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableOps
  134. def innerEdgeTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): 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
    GraphTraversalImplGraphTraversal
  135. def innerElemTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): 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
    GraphTraversalImplGraphTraversal
  136. def innerNodeDownUpTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): 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
    GraphTraversalImplGraphTraversal
  137. def innerNodeTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): 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
    GraphTraversalImplGraphTraversal
  138. def intersect(that: Set[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
  139. final def isAcyclic: Boolean

    Whether this graph has no cycle.

    Whether this graph has no cycle.

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  140. 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
  141. 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
  142. final def isCustomEdgeFilter(f: EdgeFilter): Boolean

    true if f is not equivalent to anyEdge.

    true if f is not equivalent to anyEdge.

    Definition Classes
    GraphBase
    Annotations
    @inline()
  143. final def isCustomNodeFilter(f: NodeFilter): Boolean

    true if f is not equivalent to anyNode.

    true if f is not equivalent to anyNode.

    Definition Classes
    GraphBase
    Annotations
    @inline()
  144. 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()
  145. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toOuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  146. def isDirected: Boolean

    Whether all edges of this graph are directed.

    Whether all edges of this graph are directed.

    Definition Classes
    GraphLikeGraphBase
  147. final val isDirectedT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  148. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toOuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  149. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  150. def isHyper: Boolean

    Whether this graph contains at least one hyperedges.

    Whether this graph contains at least one hyperedges.

    Definition Classes
    GraphLikeGraphBase
  151. final val isHyperT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  152. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toOuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  153. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  154. 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
    GraphLikeGraphBase
  155. 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
    GraphLikeGraphBase
  156. final val isMultiT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  157. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toOuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  158. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toOuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  159. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  160. 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()
  161. def iterableFactory: IterableFactory[Set]
    Definition Classes
    Set → Iterable → IterableOps
  162. def iterator: Iterator[Param[N, E]]

    Iterates over all nodes and all edges.

    Iterates over all nodes and all edges.

    returns

    iterator containing all nodes and all edges

    Definition Classes
    GraphLike → IterableOnce
  163. def knownSize: Int
    Definition Classes
    Graph → IterableOnce
  164. def last: Param[N, E]
    Definition Classes
    IterableOps
  165. def lastOption: Option[Param[N, E]]
    Definition Classes
    IterableOps
  166. def lazyZip[B](that: Iterable[B]): LazyZip2[Param[N, E], B, DefaultGraphImpl.this.type]
    Definition Classes
    Iterable
  167. def map[NN, EE[+X] <: EdgeLikeIn[X]](f: (Param[N, E]) => Param[NN, EE])(implicit edgeT: ClassTag[EE[NN]]): DefaultGraphImpl[NN, EE]
    Definition Classes
    GraphAsSet
  168. def map[B](f: (Param[N, E]) => B): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  169. def max[B >: Param[N, E]](implicit ord: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  170. def maxBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  171. def maxByOption[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  172. def maxDegree(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Int

    The degree of the node having the highest degree or 0 if this graph is empty.

    The degree of the node having the highest degree or 0 if this graph is empty.

    Definition Classes
    GraphDegree
  173. def maxOption[B >: Param[N, E]](implicit ord: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  174. def min[B >: Param[N, E]](implicit ord: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  175. def minBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  176. def minByOption[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  177. def minDegree(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Int

    The degree of the node having the least degree or 0 if this graph is empty.

    The degree of the node having the least degree or 0 if this graph is empty.

    Definition Classes
    GraphDegree
  178. def minOption[B >: Param[N, E]](implicit ord: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  179. def minusIsolated(n: N): DefaultGraphImpl[N, E]

    Creates a new subgraph consisting of all nodes and edges of this graph except node which is conditionally removed from this graph.

    Creates a new subgraph consisting of all nodes and edges of this graph except node which is conditionally removed from this graph. The removal only succeeds if the node is not incident with any edges or it is only incident with hooks.

    returns

    the new subgraph of this graph after the "gentle" deletion of node. If node could not be deleted, the new graph is a copy of this graph.

    Definition Classes
    AdjacencyListGraphGraphLike
  180. def minusMinus(delNodes: Iterable[N], delEdges: Iterable[E[N]]): DefaultGraphImpl[N, E]

    Implements the heart of -- calling the from factory method of the companion object.

    Implements the heart of -- calling the from factory method of the companion object. Note that this method must be reimplemented in each module having its own factory methods such as constrained does.

    Attributes
    protected
    Definition Classes
    GraphLike
  181. def minusMinusNodesEdges(delNodes: Iterable[N], delEdges: Iterable[E[N]]): (Set[N], Set[E[N]])

    Calculates the nodes and edges arguments to be passed to a factory method when delNodes and delEdges are to be deleted by --.

    Calculates the nodes and edges arguments to be passed to a factory method when delNodes and delEdges are to be deleted by --.

    Attributes
    protected
    Definition Classes
    GraphLike
  182. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  183. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  184. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  185. val n1: DefaultGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toEdgeAssoc[DefaultGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  186. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  187. final def newEdge(innerEdge: E[NodeT]): EdgeT
    Attributes
    protected
    Definition Classes
    AdjacencyListGraphGraphBase
  188. final def newEdgeTArray(size: Int): Array[EdgeT]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraphAdjacencyListBase
    Annotations
    @inline()
  189. final def newNode(n: N): NodeT
    Attributes
    protected
    Definition Classes
    AdjacencyListBaseGraphBase
    Annotations
    @inline()
  190. final def newNodeSet: NodeSetT
    Attributes
    protected
    Definition Classes
    DefaultGraphImplAdjacencyListBase
    Annotations
    @inline()
  191. final def newNodeWithHints(n: N, h: Hints): NodeBase
    Attributes
    protected
    Definition Classes
    DefaultGraphImplAdjacencyListBase
    Annotations
    @inline()
  192. def newPathBuilder(start: NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: (NodeT, NodeT) => Option[EdgeT]): 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
    GraphTraversalImplGraphTraversal
  193. def newSpecificBuilder: Builder[Param[N, E], DefaultGraphImpl[N, E]]
    Attributes
    protected
    Definition Classes
    GraphAsSet → IterableFactoryDefaults → IterableOps
  194. def newWalkBuilder(start: NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: (NodeT, NodeT) => Option[EdgeT]): 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
    GraphTraversalImplGraphTraversal
  195. def nextHandle: Handle

    Avoid calling this directly, prefer withHandle instead.

    Avoid calling this directly, prefer withHandle instead.

    Attributes
    protected
    Definition Classes
    State
  196. final val noNode: NodeFilter

    Node predicate always returning false.

    Node predicate always returning false.

    Definition Classes
    GraphBase
  197. final def nodes: 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
    DefaultGraphImplAdjacencyListGraphGraphBase
    Annotations
    @inline()
  198. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  199. 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()
  200. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  201. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  202. 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
  203. def outerEdgeTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): 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
    GraphTraversalImplGraphTraversal
  204. def outerElemTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): 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
    GraphTraversalImplGraphTraversal
  205. def outerNodeDownUpTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): 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
    GraphTraversalImplGraphTraversal
  206. def outerNodeTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): 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
    GraphTraversalImplGraphTraversal
  207. final def partition(elems: IterableOnce[Param[N, E]]): Partitions[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  208. def partition(p: (Param[N, E]) => Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    IterableOps
  209. def partitionMap[A1, A2](f: (Param[N, E]) => Either[A1, A2]): (AnySet[A1], AnySet[A2])
    Definition Classes
    IterableOps
  210. def pipe[B](f: (DefaultGraphImpl[N, E]) => B): B
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toChainingOps[DefaultGraphImpl[N, E]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  211. def plusPlus(newNodes: Iterable[N], newEdges: Iterable[E[N]]): DefaultGraphImpl[N, E]

    Implements the heart of ++ calling the from factory method of the companion object.

    Implements the heart of ++ calling the from factory method of the companion object. Note that this method must be reimplemented in each module having its own factory methods such as constrained does.

    Attributes
    protected
    Definition Classes
    GraphLike
  212. def product[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  213. def productElementNames: Iterator[String]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toOuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Product
  214. def reduce[B >: Param[N, E]](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  215. def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) => B): B
    Definition Classes
    IterableOnceOps
  216. def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) => B): Option[B]
    Definition Classes
    IterableOnceOps
  217. def reduceOption[B >: Param[N, E]](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  218. def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) => B): B
    Definition Classes
    IterableOnceOps
  219. def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  220. def releaseHandle(handle: Handle): Unit

    Avoid calling this directly, prefer withHandle instead.

    Avoid calling this directly, prefer withHandle instead.

    Attributes
    protected
    Definition Classes
    State
  221. def reversed: Iterable[Param[N, E]]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  222. def scan[B >: Param[N, E]](z: B)(op: (B, B) => B): AnySet[B]
    Definition Classes
    IterableOps
  223. def scanLeft[B](z: B)(op: (B, Param[N, E]) => B): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  224. def scanRight[B](z: B)(op: (Param[N, E], B) => B): AnySet[B]
    Definition Classes
    IterableOps
  225. val self: DefaultGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toChainingOps[DefaultGraphImpl[N, E]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  226. final def serializeTo(out: ObjectOutputStream): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  227. def size: Int
    Definition Classes
    IterableOnceOps
  228. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  229. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  230. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  231. def slice(from: Int, until: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  232. def sliding(size: Int, step: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableOps
  233. def sliding(size: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableOps
  234. def span(p: (Param[N, E]) => Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    IterableOps → IterableOnceOps
  235. def splitAt(n: Int): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    IterableOps → IterableOnceOps
  236. def stepper[S <: Stepper[_]](implicit shape: StepperShape[Param[N, E], S]): S
    Definition Classes
    IterableOnce
  237. def stringPrefix: String
    Definition Classes
    GraphLike → Set → Iterable
  238. def strongComponentTraverser(parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): 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
    GraphTraversalImplGraphTraversal
  239. def subsetOf(that: Set[Param[N, E]]): Boolean
    Definition Classes
    SetOps
  240. def subsets(): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    SetOps
  241. def subsets(len: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    SetOps
  242. def sum[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  243. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  244. val t: Set[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toTraversableEnrichments[Param[N, E], Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  245. def tail: DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps
  246. def tails: Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableOps
  247. def take(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  248. def takeRight(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps
  249. def takeWhile(p: (Param[N, E]) => Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  250. def tap[U](f: (DefaultGraphImpl[N, E]) => U): DefaultGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toChainingOps[DefaultGraphImpl[N, E]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  251. def tapEach[U](f: (Param[N, E]) => U): DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  252. def to[C1](factory: Factory[Param[N, E], C1]): C1
    Definition Classes
    IterableOnceOps
  253. def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  254. final def toBuffer[B >: Param[N, E]]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  255. def toIndexedSeq: IndexedSeq[Param[N, E]]
    Definition Classes
    IterableOnceOps
  256. def toList: List[Param[N, E]]
    Definition Classes
    IterableOnceOps
  257. def toMap[K, V](implicit ev: <:<[Param[N, E], (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  258. def toOuterNodes[E[+X] <: EdgeLike[X]]: Seq[InParam[Param[N, E], E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toTraversableEnrichments[Param[N, E], Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  259. def toSeq: Seq[Param[N, E]]
    Definition Classes
    IterableOnceOps
  260. def toSet[B >: Param[N, E]]: Set[B]
    Definition Classes
    IterableOnceOps
  261. def toSortedString(nodeSeparator: String = GraphBase.defaultSeparator, edgeSeparator: String = GraphBase.defaultSeparator, nodesEdgesSeparator: String = GraphBase.defaultSeparator, withNodesEdgesPrefix: Boolean = false)(implicit ordNode: NodeOrdering = defaultNodeOrdering, ordEdge: EdgeOrdering = defaultEdgeOrdering): String

    Same as asSortedString but additionally prefixed and parenthesized by stringPrefix.

    Same as asSortedString but additionally prefixed and parenthesized by stringPrefix.

    Definition Classes
    GraphLike
  262. def toString(): String

    Ensures sorted nodes/edges unless this Graph has more than 100 elements.

    Ensures sorted nodes/edges unless this Graph has more than 100 elements. See also asSortedString and toSortedString.

    Definition Classes
    GraphLike → Set → Function1 → Iterable → AnyRef → Any
  263. def toVector: Vector[Param[N, E]]
    Definition Classes
    IterableOnceOps
  264. final def topologicalSort[U](implicit visitor: (InnerElem) => U = empty): 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
  265. final def topologicalSortByComponent[U](implicit visitor: (InnerElem) => U = empty): Iterable[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
  266. def totalDegree(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Int

    The total degree of this graph equaling to the sum of the degrees over all nodes or 0 if this graph is empty.

    The total degree of this graph equaling to the sum of the degrees over all nodes or 0 if this graph is empty.

    nodeDegree

    the degree function to apply to the nodes defaulting to Degree. Non-default predefined degree functions are InDegree and OutDegree.

    degreeFilter

    selects nodes to be included by their degree.

    Definition Classes
    GraphDegree
  267. def totalWeight: Double
    Definition Classes
    GraphBase
  268. def transpose[B](implicit asIterable: (Param[N, E]) => Iterable[B]): AnySet[AnySet[B]]
    Definition Classes
    IterableOps
  269. final def union(that: Set[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  270. def unzip[A1, A2](implicit asPair: (Param[N, E]) => (A1, A2)): (AnySet[A1], AnySet[A2])
    Definition Classes
    IterableOps
  271. def unzip3[A1, A2, A3](implicit asTriple: (Param[N, E]) => (A1, A2, A3)): (AnySet[A1], AnySet[A2], AnySet[A3])
    Definition Classes
    IterableOps
  272. val value: DefaultGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toOuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  273. def view: View[Param[N, E]]
    Definition Classes
    IterableOps
  274. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  275. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  276. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  277. def withFilter(p: (Param[N, E]) => Boolean): WithFilter[Param[N, E], [_]AnySet[_]]
    Definition Classes
    IterableOps
  278. 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
  279. 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
  280. def zip[B](that: scala.collection.IterableOnce[B]): AnySet[(Param[N, E], B)]
    Definition Classes
    IterableOps
  281. def zipAll[A1 >: Param[N, E], B](that: Iterable[B], thisElem: A1, thatElem: B): AnySet[(A1, B)]
    Definition Classes
    IterableOps
  282. def zipWithIndex: AnySet[(Param[N, E], Int)]
    Definition Classes
    IterableOps → IterableOnceOps
  283. final def |(that: Set[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  284. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toEdgeAssoc[DefaultGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  285. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toEdgeAssoc[DefaultGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toany2stringadd[DefaultGraphImpl[N, E]] 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:
    (defaultGraphImpl: any2stringadd[DefaultGraphImpl[N, E]]).+(other)
    Definition Classes
    any2stringadd
  2. def andThen[A](g: (Boolean) => A): (Param[Param[N, E], EI]) => A
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate 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:
    (defaultGraphImpl: (Param[Param[N, E], EI]) => Boolean).andThen(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def apply(v1: Param[Param[N, E], EI]): Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate 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:
    (defaultGraphImpl: (Param[Param[N, E], EI]) => Boolean).apply(v1)
    Definition Classes
    Function1
  4. def compose[A](g: (A) => Param[Param[N, E], EI]): (A) => Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate 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:
    (defaultGraphImpl: (Param[Param[N, E], EI]) => Boolean).compose(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toOuterNode[DefaultGraphImpl[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:
    (defaultGraphImpl: OuterNode[DefaultGraphImpl[N, E]]).stringPrefix
    Definition Classes
    NodeParam
  6. def toString(): String
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to(Param[Param[N, E], EI]) => Boolean performed by method predicateToNodePredicate 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:
    (defaultGraphImpl: (Param[Param[N, E], EI]) => Boolean).toString()
    Definition Classes
    Function1 → AnyRef → Any
  7. def toString(): String
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toOuterNode[DefaultGraphImpl[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:
    (defaultGraphImpl: OuterNode[DefaultGraphImpl[N, E]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

Deprecated Value Members

  1. def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs

  2. def +(elem: Param[N, E]): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Consider requiring an immutable Set or fall back to Set.union

  3. def ++:[B >: Param[N, E]](that: scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  4. def -(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs

  5. def -(elem: Param[N, E]): DefaultGraphImpl[N, E]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Consider requiring an immutable Set or fall back to Set.diff

  6. def -!(elem: Param[N, E]): DefaultGraphImpl[N, E]

    Creates a new subgraph consisting of all nodes and edges of this graph except elem.

    Creates a new subgraph consisting of all nodes and edges of this graph except elem. If elem is of type N, this method maps to -(node: N). Otherwise the edge is deleted along with those incident nodes which would become isolated after deletion.

    elem

    node or edge to be removed.

    returns

    a new subgraph of this graph after the "ripple" deletion of the passed node or edge.

    Definition Classes
    GraphLike
    Annotations
    @deprecated
    Deprecated

    (Since version 1.13) When deleting an edge, to get nodes deleted that become isolated, delete them beforehand.

  7. def --!(elems: IterableOnce[Param[N, E]]): DefaultGraphImpl[N, E]

    Creates a new subgraph consisting of all nodes and edges of this graph but the elements of coll which will be unconditionally removed.

    Creates a new subgraph consisting of all nodes and edges of this graph but the elements of coll which will be unconditionally removed. This operation differs from -- in that edges are deleted along with those incident nodes which would become isolated after deletion.

    elems

    collection of nodes and/or edges to be removed; if the element type is N, it is removed from the node set otherwise from the edge set. See -!(elem: Param[N,E]).

    returns

    the new subgraph containing all nodes and edges of this graph after the "ripple" deletion of nodes and the simple deletion of edges in coll .

    Definition Classes
    GraphLike
    Annotations
    @deprecated
    Deprecated

    (Since version 1.13) When deleting edges, to get nodes deleted that become isolated, delete them beforehand.

  8. def /:[B](z: B)(op: (B, Param[N, E]) => B): B
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  9. final def /:[B](z: B)(op: (B, Param[N, E]) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  10. def :\[B](z: B)(op: (Param[N, E], B) => B): B
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  11. final def :\[B](z: B)(op: (Param[N, E], B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  12. def aggregate[B](z: => B)(seqop: (B, Param[N, E]) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  13. def collectFirst[B](f: PartialFunction[Param[N, E], B]): Option[B]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.collectFirst(...) instead

  14. def companion: IterableFactory[[_]AnySet[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  15. def copyToBuffer(dest: Buffer[Param[N, E]]): Unit
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

  16. final def copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  17. def count(f: (Param[N, E]) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.count(...) instead

  18. def exists(f: (Param[N, E]) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.exists(...) instead

  19. def filter(f: (Param[N, E]) => Boolean): Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.filter(...) instead

  20. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  21. def find(p: (Param[N, E]) => Boolean): Option[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  22. def flatMap[B](f: (Param[N, E]) => scala.collection.IterableOnce[B]): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable

  23. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  24. def foldLeft[B](z: B)(op: (B, Param[N, E]) => B): B
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  25. def foldRight[B](z: B)(op: (Param[N, E], B) => B): B
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  26. def forall(f: (Param[N, E]) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.forall(...) instead

  27. def foreach[U](f: (Param[N, E]) => U): Unit
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foreach(...) instead

  28. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toStringFormat[DefaultGraphImpl[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.

  29. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  30. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  31. def map[B](f: (Param[N, E]) => B): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable

  32. def max(implicit ord: Ordering[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  33. def maxBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.maxBy(...) instead

  34. def min(implicit ord: Ordering[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  35. def minBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.minBy(...) instead

  36. def mkString: String
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  37. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  38. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  39. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  40. def product(implicit num: Numeric[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  41. def reduce(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduce(...) instead

  42. def reduceLeft(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

  43. def reduceLeftOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

  44. def reduceOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceOption(...) instead

  45. def reduceRight(f: (Param[N, E], Param[N, E]) => Param[N, E]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRight(...) instead

  46. def reduceRightOption(f: (Param[N, E], Param[N, E]) => Param[N, E]): Option[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

  47. final def repr: DefaultGraphImpl[N, E]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  48. def sameElements[B >: A](that: scala.collection.IterableOnce[B]): Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sameElements instead

  49. def seq: DefaultGraphImpl.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  50. def size: Int
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  51. def sum(implicit num: Numeric[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  52. def to[C1](factory: Factory[Param[N, E], C1]): C1
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(factory) instead

  53. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  54. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

  55. def toIndexedSeq: IndexedSeq[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  56. final def toIterable: Iterable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  57. final def toIterable: DefaultGraphImpl.this.type
    Definition Classes
    Iterable → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  58. def toIterator: Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

  59. final def toIterator: Iterator[Param[N, E]]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  60. def toList: List[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(List) instead

  61. def toMap[K, V](implicit ev: <:<[Param[N, E], (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Map) instead

  62. def toSeq: Seq[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Seq) instead

  63. def toSet[B >: A]: Set[B]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Set) instead

  64. def toStream: Stream[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(LazyList) instead

  65. final def toStream: Stream[Param[N, E]]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  66. final def toTraversable: Traversable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  67. final def toTraversable: Traversable[Param[N, E]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  68. def toVector: Vector[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Vector) instead

  69. def view(from: Int, until: Int): View[Param[N, E]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

  70. def withFilter(f: (Param[N, E]) => Boolean): Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] toIterableOnceExtensionMethods[Param[N, E]] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (defaultGraphImpl: IterableOnceExtensionMethods[Param[N, E]]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.withFilter(...) instead

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

Inherited from State[N, E]

Inherited from TraverserImpl[N, E]

Inherited from AdjacencyListGraph[N, E, DefaultGraphImpl]

Inherited from AdjacencyListBase[N, E, DefaultGraphImpl]

Inherited from Graph[N, E]

Inherited from collection.Graph[N, E]

Inherited from GraphLike[N, E, [NN, EE[+XX]]DefaultGraphImpl[NN, EE]]

Inherited from GraphDegree[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from GraphAsSet[N, E, [NN, EE[+XX]]DefaultGraphImpl[NN, EE]]

Inherited from Set[Param[N, E]]

Inherited from Equals

Inherited from SetOps[Param[N, E], [_]AnySet[_], DefaultGraphImpl[N, E]]

Inherited from (Param[N, E]) => Boolean

Inherited from Iterable[Param[N, E]]

Inherited from IterableFactoryDefaults[Param[N, E], [x]Set[x]]

Inherited from IterableOps[Param[N, E], [_]AnySet[_], DefaultGraphImpl[N, E]]

Inherited from IterableOnceOps[Param[N, E], [_]AnySet[_], DefaultGraphImpl[N, E]]

Inherited from scala.collection.IterableOnce[Param[N, E]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromDefaultGraphImpl[N, E] to IterableOnceExtensionMethods[Param[N, E]]

Inherited by implicit conversion EdgeAssoc fromDefaultGraphImpl[N, E] to EdgeAssoc[DefaultGraphImpl[N, E]]

Inherited by implicit conversion predicateToNodePredicate fromDefaultGraphImpl[N, E] to (Param[Param[N, E], EI]) => Boolean

Inherited by implicit conversion TraversableEnrichments fromDefaultGraphImpl[N, E] to TraversableEnrichments[Param[N, E], Set]

Inherited by implicit conversion anyToNode fromDefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[N, E]]

Inherited by implicit conversion ChainingOps fromDefaultGraphImpl[N, E] to ChainingOps[DefaultGraphImpl[N, E]]

Inherited by implicit conversion any2stringadd fromDefaultGraphImpl[N, E] to any2stringadd[DefaultGraphImpl[N, E]]

Inherited by implicit conversion StringFormat fromDefaultGraphImpl[N, E] to StringFormat[DefaultGraphImpl[N, E]]

Inherited by implicit conversion Ensuring fromDefaultGraphImpl[N, E] to Ensuring[DefaultGraphImpl[N, E]]

Inherited by implicit conversion ArrowAssoc fromDefaultGraphImpl[N, E] to ArrowAssoc[DefaultGraphImpl[N, E]]

Ungrouped