Packages

trait GraphLike[N, E[+X] <: EdgeLikeIn[X], +This[X, Y[+X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with Graph[X, Y[X]]] extends collection.GraphLike[N, E, [X, Y[+X]]This[X, Y]] with Growable[Param[N, E]] with Shrinkable[Param[N, E]] with Cloneable[Graph[N, E]] with EdgeOps[N, E, [X, Y[+X]]This[X, Y]]

Trait with common mutable Graph methods.

Self Type
This[N, E] with GraphLike[N, E, This] with Graph[N, E]
Linear Supertypes
EdgeOps[N, E, This], Cloneable[Graph[N, E]], Cloneable, Shrinkable[Param[N, E]], Growable[Param[N, E]], Clearable, collection.GraphLike[N, E, This], GraphDegree[N, E], GraphTraversal[N, E], GraphBase[N, E], Serializable, GraphAsSet[N, E, This], Set[Param[N, E]], Equals, SetOps[Param[N, E], [_]AnySet[_], This[N, E]], (Param[N, E]) => Boolean, Iterable[Param[N, E]], IterableFactoryDefaults[Param[N, E], [x]Set[x]], IterableOps[Param[N, E], [_]AnySet[_], This[N, E]], IterableOnceOps[Param[N, E], [_]AnySet[_], This[N, E]], scala.collection.IterableOnce[Param[N, E]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphLike
  2. EdgeOps
  3. Cloneable
  4. Cloneable
  5. Shrinkable
  6. Growable
  7. Clearable
  8. GraphLike
  9. GraphDegree
  10. GraphTraversal
  11. GraphBase
  12. Serializable
  13. GraphAsSet
  14. Set
  15. Equals
  16. SetOps
  17. Function1
  18. Iterable
  19. IterableFactoryDefaults
  20. IterableOps
  21. IterableOnceOps
  22. IterableOnce
  23. AnyRef
  24. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by EdgeAssoc
  3. by predicateToNodePredicate
  4. by anyToNode
  5. by ChainingOps
  6. by any2stringadd
  7. by StringFormat
  8. by Ensuring
  9. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. trait Edge extends Serializable
    Definition Classes
    GraphBase
  2. sealed trait EdgeOrdering extends Ordering[EdgeT] with ElemOrdering
    Definition Classes
    GraphBase
  3. 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. abstract class NodeBase extends InnerNodeParam[N] with (GraphLike.this)#InnerNode
    Attributes
    protected
    Definition Classes
    GraphLike
  13. 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
  14. 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
  15. abstract class ComponentTraverser extends FluentProperties[ComponentTraverser] with Properties with Iterable[Component]

    Controls the properties of graph traversals with no specific root and allows you to produce the (weakly) connected components by a traversal or call methods like findCycle that work component-wise.

    Controls the properties of graph traversals with no specific root and allows you to produce the (weakly) connected components by a traversal or call methods like findCycle that work component-wise.

    Definition Classes
    GraphTraversal
  16. 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
  17. 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
  18. 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
  19. abstract class InnerEdgeTraverser extends TraverserMethods[EdgeT, InnerEdgeTraverser] with Traverser[EdgeT, InnerEdgeTraverser]

    Controls the properties of inner-edge graph traversals.

    Controls the properties of inner-edge graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.

    Definition Classes
    GraphTraversal
  20. abstract class InnerElemTraverser extends TraverserMethods[InnerElem, InnerElemTraverser] with Traverser[InnerElem, InnerElemTraverser]

    Controls the properties of inner-element graph traversals.

    Controls the properties of inner-element graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.

    Attributes
    protected
    Definition Classes
    GraphTraversal
  21. abstract class InnerNodeDownUpTraverser extends TraverserMethods[(Boolean, NodeT), InnerNodeDownUpTraverser] with Traverser[(Boolean, NodeT), InnerNodeDownUpTraverser]

    Controls the properties of inner-node down-up graph traversals.

    Controls the properties of inner-node down-up graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.

    Definition Classes
    GraphTraversal
  22. abstract class InnerNodeTraverser extends TraverserMethods[NodeT, InnerNodeTraverser] with Traverser[NodeT, InnerNodeTraverser]

    Controls the properties of inner-node graph traversals.

    Controls the properties of inner-node graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.

    Definition Classes
    GraphTraversal
  23. 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
  24. 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
  25. abstract class OuterEdgeTraverser extends TraverserMethods[E[N], OuterEdgeTraverser] with Traverser[E[N], OuterEdgeTraverser]

    Controls the properties of outer-edge graph traversals.

    Controls the properties of outer-edge graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.

    Definition Classes
    GraphTraversal
  26. trait OuterElemTraverser extends TraverserMethods[OuterElem[N, E], OuterElemTraverser] with Traverser[OuterElem[N, E], OuterElemTraverser]

    Controls the properties of outer-element graph traversals.

    Controls the properties of outer-element graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.

    Definition Classes
    GraphTraversal
  27. abstract class OuterNodeDownUpTraverser extends TraverserMethods[(Boolean, N), OuterNodeDownUpTraverser] with Traverser[(Boolean, N), OuterNodeDownUpTraverser]

    Controls the properties of outer-node down-up graph traversals.

    Controls the properties of outer-node down-up graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.

    Definition Classes
    GraphTraversal
  28. abstract class OuterNodeTraverser extends TraverserMethods[N, OuterNodeTraverser] with Traverser[N, OuterNodeTraverser]

    Controls the properties of outer-node graph traversals.

    Controls the properties of outer-node graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.

    Definition Classes
    GraphTraversal
  29. 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
  30. trait PathBuilder extends WalkBuilder with Builder[InnerElem, Path]

    A Builder for valid paths in this graph.

    A Builder for valid paths in this graph.

    Nodes and edges may be added either alternating or node by node respectively edge by edge. Either way, the builder ensures that the added elements build a valid path.

    A node addition fails if either the node to be added is already contained or the node is not a direct successor of the previously added node or of the target node of the previously added edge. An edge addition fails if either the edge to be added is is already contained or the edge is not an outgoing edge from the previously added node or of the target node of the previously added edge.

    It is recommended using add instead of += to track failed additions.

    Definition Classes
    GraphTraversal
  31. trait Properties extends SubgraphProperties

    Properties controlling traversals.

    Properties controlling traversals.

    Attributes
    protected
    Definition Classes
    GraphTraversal
  32. abstract class StrongComponentTraverser extends FluentProperties[StrongComponentTraverser] with Properties with Iterable[Component]

    Controls the properties of graph traversals with no specific root and allows you to produce the strongly connected components by a traversal.

    Controls the properties of graph traversals with no specific root and allows you to produce the strongly connected components by a traversal.

    Definition Classes
    GraphTraversal
  33. trait SubgraphProperties extends AnyRef

    Properties controlling the scope of traversals.

    Properties controlling the scope of traversals.

    Attributes
    protected
    Definition Classes
    GraphTraversal
  34. 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
  35. 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
  36. 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
  37. trait TraverserInnerNode extends InnerNode
    Definition Classes
    GraphTraversal
  38. 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
  39. 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
  40. trait WalkBuilder extends Builder[InnerElem, Walk] with Growable[InnerElem]

    A Builder for valid walks in this graph.

    A Builder for valid walks in this graph.

    Nodes and edges may be added either alternating or node by node respectively edge by edge. Either way, the builder ensures that the added elements build a valid walk.

    A node addition fails if the node to be added is not a direct successor of the previously added node or of the target node of the previously added edge. An edge addition fails if the edge to be added is not an outgoing edge from the previously added node or of the target node of the previously added edge.

    It is recommended using add instead of += to track failed additions.

    Definition Classes
    GraphTraversal
  41. 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
  42. trait InnerNodeOps extends AnyRef
    Definition Classes
    EdgeOps
  43. abstract type Config <: GraphConfig
    Attributes
    protected
    Definition Classes
    GraphLike
  44. type DegreeNodeSeqEntry = (Int, (GraphLike.this)#NodeT)

    Type alias for entries in degree maps returned by degreeSeqMap.

    Type alias for entries in degree maps returned by degreeSeqMap.

    Definition Classes
    GraphDegree
  45. type EdgeFilter = ((GraphLike.this)#EdgeT) => Boolean
    Definition Classes
    GraphBase
  46. trait EdgeSet extends Set[(GraphLike.this)#EdgeT] with (GraphLike.this)#EdgeSet with AddSubtract[(GraphLike.this)#EdgeT, (GraphLike.this)#EdgeSet]
  47. abstract type EdgeSetT <: (GraphLike.this)#EdgeSet
    Definition Classes
    GraphLikeGraphLikeGraphBase
  48. abstract type EdgeT <: InnerEdgeParam[N, E, (GraphLike.this)#NodeT, E] with (GraphLike.this)#InnerEdge with Serializable
    Definition Classes
    GraphLikeGraphBase
  49. trait InnerNode extends (GraphLike.this)#InnerNode with (GraphLike.this)#InnerNodeOps
  50. type Layers = Iterable[(GraphLike.this)#Layer]

    The result of a topological sort in the layered view.

    The result of a topological sort in the layered view.

    Definition Classes
    GraphTraversal
  51. type NodeFilter = ((GraphLike.this)#NodeT) => Boolean
    Definition Classes
    GraphBase
  52. trait NodeSet extends Set[(GraphLike.this)#NodeT] with (GraphLike.this)#NodeSet
  53. abstract type NodeSetT <: (GraphLike.this)#NodeSet
    Definition Classes
    GraphLikeGraphLikeGraphBase
  54. abstract type NodeT <: (GraphLike.this)#InnerNode
    Definition Classes
    GraphLikeGraphLikeGraphTraversalGraphBase
  55. type ThisGraph = GraphLike.this
    Attributes
    protected
    Definition Classes
    GraphLike
  56. type TopologicalSort = Either[(GraphLike.this)#TopologicalSortFailure, (GraphLike.this)#TopologicalOrder[(GraphLike.this)#NodeT]]
    Definition Classes
    GraphTraversal

Abstract Value Members

  1. abstract def +#(edge: E[N]): This[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.

    edge

    the edge to be added

    returns

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

    Attributes
    protected
    Definition Classes
    GraphLike
  2. abstract def +=#(edge: E[N]): GraphLike.this
    Attributes
    protected
  3. abstract def -#(edge: E[N]): This[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.

    edge

    the edge to be removed.

    returns

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

    Attributes
    protected
    Definition Classes
    GraphLike
  4. abstract def add(edge: E[N]): Boolean
  5. abstract def add(node: N): Boolean

    Adds a node to this graph.

    Adds a node to this graph.

    node

    the node to be added

    returns

    true if the node was not yet present in the graph, false otherwise.

  6. abstract def clear(): Unit
    Definition Classes
    Clearable
  7. abstract def componentTraverser(parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#ComponentTraverser

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

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

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

    An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

    Definition Classes
    GraphTraversal
  8. implicit abstract def config: generic.GraphCompanion.Config with (GraphLike.this)#Config
    Definition Classes
    GraphLike
  9. implicit abstract val edgeT: ClassTag[E[N]]
    Definition Classes
    GraphLike
  10. abstract def edges: (GraphLike.this)#EdgeSetT

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

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

    returns

    Set of all contained edges.

    Definition Classes
    GraphBase
  11. abstract val graphCompanion: GraphCompanion[[NN, EE[+XX]]This[NN, EE]]

    The companion object of This.

    The companion object of This.

    Definition Classes
    GraphAsSet
  12. abstract def innerEdgeTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#InnerEdgeTraverser

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

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

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

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

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

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

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

    An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

    Definition Classes
    GraphTraversal
  14. abstract def innerNodeDownUpTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#InnerNodeDownUpTraverser

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

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

    root

    The node where subsequent graph traversals start.

    parameters

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

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

    An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

    Definition Classes
    GraphTraversal
  15. abstract def innerNodeTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#InnerNodeTraverser

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

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

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

    An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

    Definition Classes
    GraphTraversal
  16. abstract def newEdge(innerEdge: E[(GraphLike.this)#NodeT]): (GraphLike.this)#EdgeT
    Attributes
    protected
    Definition Classes
    GraphBase
  17. abstract def newNode(n: N): (GraphLike.this)#NodeT
    Attributes
    protected
    Definition Classes
    GraphBase
  18. abstract def newPathBuilder(start: (GraphLike.this)#NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => Option[(GraphLike.this)#EdgeT] = anyEdgeSelector): (GraphLike.this)#PathBuilder

    Instantiates a PathBuilder for this graph.

    Instantiates a PathBuilder for this graph.

    start

    The node this path starts at.

    sizeHint

    Expected maximum number of nodes on this path.

    edgeSelector

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

    Definition Classes
    GraphTraversal
  19. abstract def newWalkBuilder(start: (GraphLike.this)#NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => Option[(GraphLike.this)#EdgeT] = anyEdgeSelector): (GraphLike.this)#WalkBuilder

    Instantiates a WalkBuilder for this graph.

    Instantiates a WalkBuilder for this graph.

    start

    The node this walk starts at.

    sizeHint

    Expected maximum number of nodes on this walk.

    edgeSelector

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

    Definition Classes
    GraphTraversal
  20. abstract def nodes: (GraphLike.this)#NodeSetT

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

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

    returns

    Set of all contained nodes.

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

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

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

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

    An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

    Definition Classes
    GraphTraversal
  22. abstract def outerElemTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#OuterElemTraverser

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

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

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

    An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

    Definition Classes
    GraphTraversal
  23. abstract def outerNodeDownUpTraverser(root: (GraphLike.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#OuterNodeDownUpTraverser

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

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

    root

    The node where subsequent graph traversals start.

    parameters

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

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

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

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

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

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

    An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

    Definition Classes
    GraphTraversal
  25. abstract def strongComponentTraverser(parameters: Parameters = Parameters(), subgraphNodes: (GraphLike.this)#NodeFilter = anyNode, subgraphEdges: (GraphLike.this)#EdgeFilter = anyEdge, ordering: (GraphLike.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphLike.this)#Weight] = None): (GraphLike.this)#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
    GraphTraversal
  26. abstract def upsert(edge: E[N]): Boolean

    If an inner edge equaling to edge is present in this graph, it is replaced by edge, otherwise edge will be inserted.

    If an inner edge equaling to edge is present in this graph, it is replaced by edge, otherwise edge will be inserted. Such an update may be useful whenever non-key parts of an immutable edge are to be modified.

    edge

    The edge to add to this graph.

    returns

    true if edge has been inserted.

Concrete Value Members

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

    Ordering for the path dependent type EdgeT.

    Ordering for the path dependent type EdgeT.

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

    The empty ElemOrdering.

    The empty ElemOrdering.

    Definition Classes
    GraphBase
  7. object Node extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  8. object NodeOrdering extends Serializable
    Definition Classes
    GraphBase
  9. object 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]]): This[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  25. def &=(coll: Iterable[Param[N, E]]): GraphLike.this

    Shrinks this graph to its intersection with coll.

    Shrinks this graph to its intersection with coll.

    coll

    Collection of nodes and/or edges to intersect with;

    returns

    this graph shrinked by the nodes and edges not contained in coll.

  26. final def &~(that: Set[Param[N, E]]): This[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  27. def +(node: N): This[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.

    node

    the node to be added

    returns

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

    Definition Classes
    GraphLikeGraphLike
  28. final def ++(that: scala.collection.IterableOnce[Param[N, E]]): This[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. final def ++=(xs: scala.collection.IterableOnce[Param[N, E]]): GraphLike.this
    Definition Classes
    Growable
    Annotations
    @inline()
  31. final def +=(node: N): GraphLike.this
    Annotations
    @inline()
  32. final def +=(elem: Param[N, E]): GraphLike.this
    Definition Classes
    Growable
    Annotations
    @inline()
  33. final def +~%+=[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): GraphLike.this

    Same as addWLEdge(node_1, node_2, nodes)(weight, label) except for the returned result.

    Same as addWLEdge(node_1, node_2, nodes)(weight, label) except for the returned result.

    returns

    This mutable graph containing the hyperedge that has been created or found. to be created equals to an already existing hyperedge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  34. final def +~%+=[EE[+X] <: E[X] with WLEdgeBound[X], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): GraphLike.this

    Same as addWLEdge(node_1, node_2)(weight, label) except for the returned result.

    Same as addWLEdge(node_1, node_2)(weight, label) except for the returned result.

    returns

    This mutable graph containing the edge that has been created or found.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  35. final def +~%=[EE[+X] <: E[X] with WHyperEdgeBound[X]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): GraphLike.this

    Same as addWEdge(node_1, node_2, nodes)(weight) except for the returned result.

    Same as addWEdge(node_1, node_2, nodes)(weight) except for the returned result.

    returns

    This mutable graph containing the hyperedge that has been created or found. to be created equals to an already existing hyperedge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  36. final def +~%=[EE[+X] <: E[X] with WEdgeBound[X]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): GraphLike.this

    Same as addWEdge(node_1, node_2)(weight) except for the returned result.

    Same as addWEdge(node_1, node_2)(weight) except for the returned result.

    returns

    This mutable graph containing the edge that has been created or found.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  37. final def +~+=[EE[+X] <: E[X] with LHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): GraphLike.this

    Same as addLEdge(node_1, node_2, nodes)(label) except for the returned result.

    Same as addLEdge(node_1, node_2, nodes)(label) except for the returned result.

    returns

    This mutable graph containing the hyperedge that has been created or found. to be created equals to an already existing hyperedge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  38. final def +~+=[EE[+X] <: E[X] with LEdgeBound[X], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): GraphLike.this

    Same as addLEdge(node_1, node_2)(label) except for the returned result.

    Same as addLEdge(node_1, node_2)(label) except for the returned result.

    returns

    This mutable graph containing the edge that has been created or found.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  39. final def +~=(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): GraphLike.this

    Same as addEdge(node_1, node_2, nodes) except for the returned result.

    Same as addEdge(node_1, node_2, nodes) except for the returned result.

    returns

    This mutable graph containing the hyperedge that has been created or found. to be created equals to an already existing hyperedge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  40. final def +~=(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): GraphLike.this

    Same as addEdge(node_1, node_2) except for the returned result.

    Same as addEdge(node_1, node_2) except for the returned result.

    returns

    This mutable graph containing the edge that has been created or found.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  41. final def -(edge: E[N]): This[N, E]
    Annotations
    @inline()
  42. final def -(node: N): This[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.

    node

    the node to be removed.

    returns

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

    Definition Classes
    GraphLikeGraphLike
    Annotations
    @inline()
  43. final def -!(edge: E[N]): This[N, E]
    Annotations
    @inline()
  44. final def -!#(edge: E[N]): This[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.

    edge

    the edge to be removed.

    returns

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

    Attributes
    protected
    Definition Classes
    GraphLikeGraphLike
    Annotations
    @inline()
  45. def -!=(elem: Param[N, E]): GraphLike.this
  46. final def -!=#(edge: E[N]): GraphLike.this
    Attributes
    protected
    Annotations
    @inline()
  47. def --(elems: IterableOnce[Param[N, E]]): This[N, E]
    Definition Classes
    GraphAsSet → SetOps
  48. final def --!=(coll: Iterable[Param[N, E]]): This[N, E]

    Removes all elements of coll from this graph.

    Removes all elements of coll from this graph. Edges will be ripple removed.

    coll

    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.

    returns

    this graph shrinked by the nodes and edges contained in coll.

    Annotations
    @inline()
  49. final def --=(xs: scala.collection.IterableOnce[Param[N, E]]): GraphLike.this
    Definition Classes
    Shrinkable
    Annotations
    @inline()
  50. final def -=(node: N): GraphLike.this
    Annotations
    @inline()
  51. final def -=(elem: Param[N, E]): GraphLike.this
    Definition Classes
    Shrinkable
    Annotations
    @inline()
  52. final def -=#(edge: E[N]): GraphLike.this
    Attributes
    protected
    Annotations
    @inline()
  53. def ->[B](y: B): (GraphLike[N, E, This], B)
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toArrowAssoc[GraphLike[N, E, This]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  54. final def -?=(node: N): GraphLike.this
    Annotations
    @inline()
  55. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  56. def addAll(xs: scala.collection.IterableOnce[Param[N, E]]): GraphLike.this
    Definition Classes
    Growable
  57. final def addAndGet(edge: E[N]): (GraphLike.this)#EdgeT

    Adds the given edge if not yet present and returns it as an inner edge.

    Adds the given edge if not yet present and returns it as an inner edge.

    edge

    the edge to add.

    returns

    the inner edge containing the added edge.

    Annotations
    @inline()
  58. final def addAndGet(node: N): (GraphLike.this)#NodeT

    Adds the given node if not yet present and returns it as an inner node.

    Adds the given node if not yet present and returns it as an inner node.

    node

    the node to add.

    returns

    inner node containing the added node.

    Annotations
    @inline()
  59. def addAndGetEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): (GraphLike.this)#EdgeT

    Same as addEdge(node_1, node_2, nodes) except for the returned result.

    Same as addEdge(node_1, node_2, nodes) except for the returned result.

    returns

    The new hyperedge or the corresponding contained hyperedge if the hyperedge to be created equals to an already existing hyperedge.

    Definition Classes
    EdgeOps
  60. final def addAndGetEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): (GraphLike.this)#EdgeT

    Same as addEdge(node_1, node_2) except for the returned result.

    Same as addEdge(node_1, node_2) except for the returned result.

    returns

    The new edge or the corresponding contained edge if the edge to be created equals to an already existing edge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  61. def addAndGetLEdge[EE[+X] <: E[X] with LHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): (GraphLike.this)#EdgeT

    Same as addLEdge(node_1, node_2, nodes)(label) except for the returned result.

    Same as addLEdge(node_1, node_2, nodes)(label) except for the returned result.

    returns

    The new hyperedge or the corresponding contained hyperedge if the hyperedge to be created equals to an already existing hyperedge.

    Definition Classes
    EdgeOps
  62. final def addAndGetLEdge[EE[+X] <: E[X] with LEdgeBound[X], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): (GraphLike.this)#EdgeT

    Same as addLEdge(node_1, node_2)(label) except for the returned result.

    Same as addLEdge(node_1, node_2)(label) except for the returned result.

    returns

    The new edge or the corresponding contained edge if the edge to be created equals to an already existing edge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  63. def addAndGetWEdge[EE[+X] <: E[X] with WHyperEdgeBound[X]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): (GraphLike.this)#EdgeT

    Same as addWEdge(node_1, node_2, nodes)(weight) except for the returned result.

    Same as addWEdge(node_1, node_2, nodes)(weight) except for the returned result.

    returns

    The new hyperedge or the corresponding contained hyperedge if the hyperedge to be created equals to an already existing hyperedge.

    Definition Classes
    EdgeOps
  64. final def addAndGetWEdge[EE[+X] <: E[X] with WEdgeBound[X]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): (GraphLike.this)#EdgeT

    Same as addWEdge(node_1, node_2)(weight) except for the returned result.

    Same as addWEdge(node_1, node_2)(weight) except for the returned result.

    returns

    The new edge or the corresponding contained edge if the edge to be created equals to an already existing edge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  65. def addAndGetWLEdge[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): (GraphLike.this)#EdgeT

    Same as addWLEdge(node_1, node_2, nodes)(weight, label) except for the returned result.

    Same as addWLEdge(node_1, node_2, nodes)(weight, label) except for the returned result.

    returns

    The new hyperedge or the corresponding contained hyperedge if the hyperedge to be created equals to an already existing hyperedge.

    Definition Classes
    EdgeOps
  66. final def addAndGetWLEdge[EE[+X] <: E[X] with WLEdgeBound[X], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): (GraphLike.this)#EdgeT

    Same as addWLEdge(node_1, node_2)(weight, label) except for the returned result.

    Same as addWLEdge(node_1, node_2)(weight, label) except for the returned result.

    returns

    The new edge or the corresponding contained edge if the edge to be created equals to an already existing edge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  67. final def addEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): Boolean

    Creates a new inner hyperedge between node_1, node_2 and nodes using edgeFactory and adds it to the edge set of this graph.

    Creates a new inner hyperedge between node_1, node_2 and nodes using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    nodes

    The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  68. final def addEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): Boolean

    Creates a new inner edge between node_1 and node_2 using edgeFactory and adds it to the edge set of this graph.

    Creates a new inner edge between node_1 and node_2 using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  69. final def addLEdge[EE[+X] <: E[X] with LHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): Boolean

    Creates a new weighted and labeled inner hyperedge between node_1, node_2 and nodes using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted and labeled inner hyperedge between node_1, node_2 and nodes using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    nodes

    The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.

    label

    The value the labeled edge to be created should have as its label.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  70. final def addLEdge[EE[+X] <: E[X] with LEdgeBound[X], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): Boolean

    Creates a new labeled inner edge between node_1 and node_2 using edgeFactory and adds it to the edge set of this graph.

    Creates a new labeled inner edge between node_1 and node_2 using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    label

    The value the labeled edge to be created should have as its label.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  71. def addOne(elem: Param[N, E]): GraphLike.this
    Definition Classes
    GraphLike → Growable
  72. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  73. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  74. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  75. final def addWEdge[EE[+X] <: E[X] with WHyperEdgeBound[X]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): Boolean

    Creates a new weighted inner hyperedge between node_1, node_2 and nodes using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted inner hyperedge between node_1, node_2 and nodes using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    nodes

    The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.

    weight

    The number the weighted edge to be created should have as its weight.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  76. final def addWEdge[EE[+X] <: E[X] with WEdgeBound[X]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): Boolean

    Creates a new weighted inner edge between node_1 and node_2 using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted inner edge between node_1 and node_2 using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    weight

    The number the weighted edge to be created should have as its weight.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  77. final def addWLEdge[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): Boolean

    Creates a new weighted and labeled inner hyperedge between node_1, node_2 and nodes using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted and labeled inner hyperedge between node_1, node_2 and nodes using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    nodes

    The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.

    weight

    The number the weighted edge to be created should have as its weight.

    label

    The value the labeled edge to be created should have as its label.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  78. final def addWLEdge[EE[+X] <: E[X] with WLEdgeBound[X], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): Boolean

    Creates a new weighted and labeled inner edge between node_1 and node_2 using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted and labeled inner edge between node_1 and node_2 using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set.

    node_1

    The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.

    node_2

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    weight

    The number the weighted edge to be created should have as its weight.

    label

    The value the labeled edge to be created should have as its label.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

    Definition Classes
    EdgeOps
    Annotations
    @inline()
  79. def andThen[A](g: (Boolean) => A): (Param[N, E]) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  80. final val anyEdge: (GraphLike.this)#EdgeFilter

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

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

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

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

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

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

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

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

    Definition Classes
    GraphBase
  83. final lazy val anyOrdering: AnyOrdering[N]
    Attributes
    protected
    Definition Classes
    GraphBase
  84. final def apply(elem: Param[N, E]): Boolean
    Definition Classes
    SetOps → Function1
    Annotations
    @inline()
  85. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  86. def asSortedString(nodeSeparator: String = GraphBase.defaultSeparator, edgeSeparator: String = GraphBase.defaultSeparator, nodesEdgesSeparator: String = GraphBase.defaultSeparator, withNodesEdgesPrefix: Boolean = false)(implicit ordNode: (GraphLike.this)#NodeOrdering = defaultNodeOrdering, ordEdge: (GraphLike.this)#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
  87. final def bulkOp(elems: IterableOnce[Param[N, E]], isPlusPlus: Boolean): This[N, E]

    Prepares and calls plusPlus or minusMinus.

    Prepares and calls plusPlus or minusMinus.

    Attributes
    protected
    Definition Classes
    GraphLike → GraphAsSet
  88. def canEqual(that: Any): Boolean
    Definition Classes
    Set → Equals
  89. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  90. def clone(): This[N, E]
    Definition Classes
    GraphLike → Cloneable → AnyRef
  91. final def coll: GraphLike.this
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  92. def collect[B](pf: PartialFunction[Param[N, E], B]): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  93. def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
    Definition Classes
    IterableOnceOps
  94. def compose[A](g: (A) => Param[N, E]): (A) => Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  95. def concat(elems: IterableOnce[Param[N, E]]): This[N, E]
    Definition Classes
    GraphAsSet → SetOps
  96. def concat[B >: Param[N, E]](suffix: scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps
  97. 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
  98. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  99. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  100. def copyToArray[B >: Param[N, E]](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  101. def corresponds[B](that: scala.collection.IterableOnce[B])(p: (Param[N, E], B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  102. def count(p: (Param[N, E]) => Boolean): Int
    Definition Classes
    IterableOnceOps
  103. final lazy val defaultEdgeOrdering: (GraphLike.this)#EdgeOrdering
    Definition Classes
    GraphBase
  104. final lazy val defaultNodeOrdering: (GraphLike.this)#NodeOrdering
    Definition Classes
    GraphBase
  105. final def defaultPathSize: Int
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  106. def degreeCount(implicit nodeDegree: (GraphLike.this)#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
  107. def degreeNodeSeq(implicit nodeDegree: (GraphLike.this)#DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): Seq[(GraphLike.this)#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
  108. def degreeNodesMap(implicit nodeDegree: (GraphLike.this)#DegreeFunction = Degree, degreeFilter: (Int) => Boolean = AnyDegree): SortedMap[Int, AnySet[(GraphLike.this)#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
  109. def degreeSeq(implicit nodeDegree: (GraphLike.this)#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
  110. def degreeSet(implicit nodeDegree: (GraphLike.this)#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
  111. def diff(that: AnySet[Param[N, E]]): This[N, E]
    Definition Classes
    GraphAsSet → SetOps
  112. def drop(n: Int): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  113. def dropRight(n: Int): This[N, E]
    Definition Classes
    IterableOps
  114. def dropWhile(p: (Param[N, E]) => Boolean): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  115. implicit final def edgeToEdgeCont(e: E[N]): E[(GraphLike.this)#NodeT]
    Attributes
    protected
    Definition Classes
    GraphBase
  116. def empty: This[N, E]
    Definition Classes
    GraphAsSet → IterableFactoryDefaults → IterableOps
  117. def ensuring(cond: (GraphLike[N, E, This]) => Boolean, msg: => Any): GraphLike[N, E, This]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toEnsuring[GraphLike[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  118. def ensuring(cond: (GraphLike[N, E, This]) => Boolean): GraphLike[N, E, This]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toEnsuring[GraphLike[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  119. def ensuring(cond: Boolean, msg: => Any): GraphLike[N, E, This]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toEnsuring[GraphLike[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  120. def ensuring(cond: Boolean): GraphLike[N, E, This]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toEnsuring[GraphLike[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  121. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  122. 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
  123. def excl(elem: Param[N, E]): This[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
  124. def exists(p: (Param[N, E]) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  125. def filter(pred: (Param[N, E]) => Boolean): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  126. def filterNot(pred: (Param[N, E]) => Boolean): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  127. final def find(outerEdge: E[N]): Option[(GraphLike.this)#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()
  128. final def find(outerNode: N): Option[(GraphLike.this)#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()
  129. def find(p: (Param[N, E]) => Boolean): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  130. final def findCycle[U](implicit visitor: ((GraphLike.this)#InnerElem) => U = empty): Option[(GraphLike.this)#Cycle]

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

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

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

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

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

    Definition Classes
    GraphTraversal
  132. def flatMap[B](f: (Param[N, E]) => scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  133. def flatten[B](implicit asIterable: (Param[N, E]) => scala.collection.IterableOnce[B]): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  134. def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  135. def foldLeft[B](z: B)(op: (B, Param[N, E]) => B): B
    Definition Classes
    IterableOnceOps
  136. def foldRight[B](z: B)(op: (Param[N, E], B) => B): B
    Definition Classes
    IterableOnceOps
  137. def forall(p: (Param[N, E]) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  138. def foreach[U](f: (Param[N, E]) => U): Unit
    Definition Classes
    IterableOnceOps
  139. def fromSpecific(coll: IterableOnce[Param[N, E]]): This[N, E]
    Attributes
    protected
    Definition Classes
    GraphAsSet → IterableFactoryDefaults → IterableOps
  140. final def get(outerEdge: E[N]): (GraphLike.this)#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()
  141. final def get(outerNode: N): (GraphLike.this)#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()
  142. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  143. final def getOrElse(outerEdge: E[N], default: (GraphLike.this)#EdgeT): (GraphLike.this)#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()
  144. final def getOrElse(outerNode: N, default: (GraphLike.this)#NodeT): (GraphLike.this)#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()
  145. 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
  146. def groupBy[K](f: (Param[N, E]) => K): Map[K, This[N, E]]
    Definition Classes
    IterableOps
  147. def groupMap[K, B](key: (Param[N, E]) => K)(f: (Param[N, E]) => B): Map[K, AnySet[B]]
    Definition Classes
    IterableOps
  148. def groupMapReduce[K, B](key: (Param[N, E]) => K)(f: (Param[N, E]) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  149. def grouped(size: Int): Iterator[This[N, E]]
    Definition Classes
    IterableOps
  150. def hashCode(): Int
    Definition Classes
    Set → AnyRef → Any
  151. def having(node: (GraphLike.this)#NodeFilter = _ => false, edge: (GraphLike.this)#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
  152. def head: Param[N, E]
    Definition Classes
    IterableOps
  153. def headOption: Option[Param[N, E]]
    Definition Classes
    IterableOps
  154. def incl(elem: Param[N, E]): This[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
  155. def init: This[N, E]
    Definition Classes
    IterableOps
  156. 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
  157. def inits: Iterator[This[N, E]]
    Definition Classes
    IterableOps
  158. def intersect(that: Set[Param[N, E]]): This[N, E]
    Definition Classes
    SetOps
  159. final def isAcyclic: Boolean

    Whether this graph has no cycle.

    Whether this graph has no cycle.

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  160. 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
  161. 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
  162. final def isCustomEdgeFilter(f: (GraphLike.this)#EdgeFilter): Boolean

    true if f is not equivalent to anyEdge.

    true if f is not equivalent to anyEdge.

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

    true if f is not equivalent to anyNode.

    true if f is not equivalent to anyNode.

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

    Whether all edges of this graph are directed.

    Whether all edges of this graph are directed.

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

    Whether this graph contains at least one hyperedges.

    Whether this graph contains at least one hyperedges.

    Definition Classes
    GraphLikeGraphBase
  171. final val isHyperT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  172. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  173. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  174. 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
  175. 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
  176. final val isMultiT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  177. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  178. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  179. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  180. 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()
  181. def iterableFactory: IterableFactory[Set]
    Definition Classes
    Set → Iterable → IterableOps
  182. 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
  183. def knownSize: Int
    Definition Classes
    GraphLike → Growable → IterableOnce
  184. def last: Param[N, E]
    Definition Classes
    IterableOps
  185. def lastOption: Option[Param[N, E]]
    Definition Classes
    IterableOps
  186. def lazyZip[B](that: Iterable[B]): LazyZip2[Param[N, E], B, GraphLike.this]
    Definition Classes
    Iterable
  187. def map[NN, EE[+X] <: EdgeLikeIn[X]](f: (Param[N, E]) => Param[NN, EE])(implicit edgeT: ClassTag[EE[NN]]): This[NN, EE]
    Definition Classes
    GraphAsSet
  188. def map[B](f: (Param[N, E]) => B): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  189. def max[B >: Param[N, E]](implicit ord: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  190. def maxBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  191. def maxByOption[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  192. def maxDegree(implicit nodeDegree: (GraphLike.this)#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
  193. def maxOption[B >: Param[N, E]](implicit ord: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  194. def min[B >: Param[N, E]](implicit ord: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  195. def minBy[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    IterableOnceOps
  196. def minByOption[B](f: (Param[N, E]) => B)(implicit cmp: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  197. def minDegree(implicit nodeDegree: (GraphLike.this)#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
  198. def minOption[B >: Param[N, E]](implicit ord: Ordering[B]): Option[Param[N, E]]
    Definition Classes
    IterableOnceOps
  199. final def minusIsolated(node: N): This[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.

    node

    the node to be gently removed.

    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
    GraphLikeGraphLike
    Annotations
    @inline()
  200. def minusMinus(delNodes: Iterable[N], delEdges: Iterable[E[N]]): This[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
  201. 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
  202. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  203. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  204. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  205. val n1: GraphLike[N, E, This]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toEdgeAssoc[GraphLike[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  206. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  207. def newSpecificBuilder: Builder[Param[N, E], This[N, E]]
    Attributes
    protected
    Definition Classes
    GraphAsSet → IterableFactoryDefaults → IterableOps
  208. final val noNode: (GraphLike.this)#NodeFilter

    Node predicate always returning false.

    Node predicate always returning false.

    Definition Classes
    GraphBase
  209. def nodesToCEdgeCont[EE[+X] <: E[X] with CHyperEdgeBound[X]](factory: CHyperEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[(GraphLike.this)#NodeT]

    Creates a new custom inner hyperedge without modifying the node or edge set .

    Creates a new custom inner hyperedge without modifying the node or edge set .

    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  210. def nodesToCEdgeCont[EE[+X] <: E[X] with CEdgeBound[X]](factory: CEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N): E[(GraphLike.this)#NodeT]

    Creates a new custom inner edge without modifying the node or edge set .

    Creates a new custom inner edge without modifying the node or edge set .

    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  211. final def nodesToEdge(edgeFactory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit endpointsKind: CollectionKind): (GraphLike.this)#EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  212. final def nodesToEdge(edgeFactory: EdgeCompanion[E], node_1: N, node_2: N): (GraphLike.this)#EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  213. def nodesToEdgeCont(factory: EdgeCompanion[E], node_1: N, node_2: N): E[(GraphLike.this)#NodeT]

    Creates a new simple inner edge without modifying the node or edge set .

    Creates a new simple inner edge without modifying the node or edge set .

    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  214. def nodesToEdgeCont(factory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[(GraphLike.this)#NodeT]

    Creates a new simple inner hyperedge without modifying the node or edge set .

    Creates a new simple inner hyperedge without modifying the node or edge set .

    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  215. final def nodesToLEdge[EE[+X] <: E[X] with LHyperEdgeBound[X], L](edgeFactory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*): (GraphLike.this)#EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  216. final def nodesToLEdge[EE[+X] <: E[X] with LEdgeBound[X], L](edgeFactory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): (GraphLike.this)#EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  217. def nodesToLEdgeCont[EE[+X] <: E[X] with LEdgeBound[X], L](factory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): E[(GraphLike.this)#NodeT]

    Creates a new labeled inner edge without modifying the node or edge set .

    Creates a new labeled inner edge without modifying the node or edge set .

    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  218. def nodesToLEdgeCont[EE[+X] <: E[X] with LHyperEdgeBound[X], L](factory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind = Bag): E[(GraphLike.this)#NodeT]

    Creates a new labeled inner hyperedge without modifying the node or edge set .

    Creates a new labeled inner hyperedge without modifying the node or edge set .

    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  219. final def nodesToWEdge[EE[+X] <: E[X] with WHyperEdgeBound[X]](edgeFactory: WHyperEdgeCompanion[EE], weight: Double, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): (GraphLike.this)#EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  220. final def nodesToWEdge[EE[+X] <: E[X] with WEdgeBound[X]](edgeFactory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): (GraphLike.this)#EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  221. def nodesToWEdgeCont[EE[+X] <: E[X] with WEdgeBound[X]](factory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): E[(GraphLike.this)#NodeT]

    Creates a new weighted inner edge without modifying the node or edge set .

    Creates a new weighted inner edge without modifying the node or edge set .

    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  222. def nodesToWEdgeCont[EE[+X] <: E[X] with WHyperEdgeBound[X]](factory: WHyperEdgeCompanion[EE], weight: Double, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[(GraphLike.this)#NodeT]

    Creates a new weighted inner hyperedge without modifying the node or edge set .

    Creates a new weighted inner hyperedge without modifying the node or edge set .

    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  223. final def nodesToWLEdge[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](edgeFactory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): (GraphLike.this)#EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  224. final def nodesToWLEdge[EE[+X] <: E[X] with WLEdgeBound[X], L](edgeFactory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N): (GraphLike.this)#EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  225. def nodesToWLEdgeCont[EE[+X] <: E[X] with WLEdgeBound[X], L](factory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N): E[(GraphLike.this)#NodeT]

    Creates a new weighted and labeled inner edge without modifying the node or edge set .

    Creates a new weighted and labeled inner edge without modifying the node or edge set .

    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  226. def nodesToWLEdgeCont[EE[+X] <: E[X] with WLHyperEdgeBound[X], L](factory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[(GraphLike.this)#NodeT]

    Creates a new weighted and labeled inner hyperedge without modifying the node or edge set .

    Creates a new weighted and labeled inner hyperedge without modifying the node or edge set .

    Attributes
    protected[collection]
    Definition Classes
    EdgeOps
  227. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  228. 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()
  229. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  230. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  231. 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
  232. final def partition(elems: IterableOnce[Param[N, E]]): Partitions[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  233. def partition(p: (Param[N, E]) => Boolean): (This[N, E], This[N, E])
    Definition Classes
    IterableOps
  234. def partitionMap[A1, A2](f: (Param[N, E]) => Either[A1, A2]): (AnySet[A1], AnySet[A2])
    Definition Classes
    IterableOps
  235. def pipe[B](f: (GraphLike[N, E, This]) => B): B
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toChainingOps[GraphLike[N, E, This]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  236. def plusPlus(newNodes: Iterable[N], newEdges: Iterable[E[N]]): This[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
  237. def product[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  238. def productElementNames: Iterator[String]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Product
  239. def reduce[B >: Param[N, E]](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  240. def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) => B): B
    Definition Classes
    IterableOnceOps
  241. def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) => B): Option[B]
    Definition Classes
    IterableOnceOps
  242. def reduceOption[B >: Param[N, E]](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  243. def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) => B): B
    Definition Classes
    IterableOnceOps
  244. def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  245. final def remove(edge: E[N]): Boolean
    Annotations
    @inline()
  246. final def remove(node: N): Boolean
    Annotations
    @inline()
  247. final def removeGently(node: N): Boolean
    Annotations
    @inline()
  248. final def removeWithNodes(edge: E[N]): Boolean
    Annotations
    @inline()
  249. def reversed: Iterable[Param[N, E]]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  250. def scan[B >: Param[N, E]](z: B)(op: (B, B) => B): AnySet[B]
    Definition Classes
    IterableOps
  251. def scanLeft[B](z: B)(op: (B, Param[N, E]) => B): AnySet[B]
    Definition Classes
    IterableOps → IterableOnceOps
  252. def scanRight[B](z: B)(op: (Param[N, E], B) => B): AnySet[B]
    Definition Classes
    IterableOps
  253. val self: GraphLike[N, E, This]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toChainingOps[GraphLike[N, E, This]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  254. def size: Int
    Definition Classes
    IterableOnceOps
  255. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  256. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  257. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  258. def slice(from: Int, until: Int): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  259. def sliding(size: Int, step: Int): Iterator[This[N, E]]
    Definition Classes
    IterableOps
  260. def sliding(size: Int): Iterator[This[N, E]]
    Definition Classes
    IterableOps
  261. def span(p: (Param[N, E]) => Boolean): (This[N, E], This[N, E])
    Definition Classes
    IterableOps → IterableOnceOps
  262. def splitAt(n: Int): (This[N, E], This[N, E])
    Definition Classes
    IterableOps → IterableOnceOps
  263. def stepper[S <: Stepper[_]](implicit shape: StepperShape[Param[N, E], S]): S
    Definition Classes
    IterableOnce
  264. def stringPrefix: String
    Definition Classes
    GraphLike → Set → Iterable
  265. def subsetOf(that: Set[Param[N, E]]): Boolean
    Definition Classes
    SetOps
  266. def subsets(): Iterator[This[N, E]]
    Definition Classes
    SetOps
  267. def subsets(len: Int): Iterator[This[N, E]]
    Definition Classes
    SetOps
  268. def subtractAll(xs: scala.collection.IterableOnce[Param[N, E]]): GraphLike.this
    Definition Classes
    Shrinkable
  269. def subtractOne(elem: Param[N, E]): GraphLike.this
    Definition Classes
    GraphLike → Shrinkable
  270. def sum[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  271. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  272. def tail: This[N, E]
    Definition Classes
    IterableOps
  273. def tails: Iterator[This[N, E]]
    Definition Classes
    IterableOps
  274. def take(n: Int): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  275. def takeRight(n: Int): This[N, E]
    Definition Classes
    IterableOps
  276. def takeWhile(p: (Param[N, E]) => Boolean): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  277. def tap[U](f: (GraphLike[N, E, This]) => U): GraphLike[N, E, This]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toChainingOps[GraphLike[N, E, This]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  278. def tapEach[U](f: (Param[N, E]) => U): This[N, E]
    Definition Classes
    IterableOps → IterableOnceOps
  279. def to[C1](factory: Factory[Param[N, E], C1]): C1
    Definition Classes
    IterableOnceOps
  280. def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  281. final def toBuffer[B >: Param[N, E]]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  282. def toIndexedSeq: IndexedSeq[Param[N, E]]
    Definition Classes
    IterableOnceOps
  283. def toList: List[Param[N, E]]
    Definition Classes
    IterableOnceOps
  284. def toMap[K, V](implicit ev: <:<[Param[N, E], (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  285. def toSeq: Seq[Param[N, E]]
    Definition Classes
    IterableOnceOps
  286. def toSet[B >: Param[N, E]]: Set[B]
    Definition Classes
    IterableOnceOps
  287. def toSortedString(nodeSeparator: String = GraphBase.defaultSeparator, edgeSeparator: String = GraphBase.defaultSeparator, nodesEdgesSeparator: String = GraphBase.defaultSeparator, withNodesEdgesPrefix: Boolean = false)(implicit ordNode: (GraphLike.this)#NodeOrdering = defaultNodeOrdering, ordEdge: (GraphLike.this)#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
  288. 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
  289. def toVector: Vector[Param[N, E]]
    Definition Classes
    IterableOnceOps
  290. final def topologicalSort[U](implicit visitor: ((GraphLike.this)#InnerElem) => U = empty): (GraphLike.this)#TopologicalSort

    Sorts this graph topologically.

    Sorts this graph topologically. Hooks are ignored.

    visitor

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

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

    Sorts every isolated component of this graph topologically.

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

    visitor

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

    Definition Classes
    GraphTraversal
  292. def totalDegree(implicit nodeDegree: (GraphLike.this)#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
  293. def totalWeight: Double
    Definition Classes
    GraphBase
  294. def transpose[B](implicit asIterable: (Param[N, E]) => Iterable[B]): AnySet[AnySet[B]]
    Definition Classes
    IterableOps
  295. final def union(that: Set[Param[N, E]]): This[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  296. def unzip[A1, A2](implicit asPair: (Param[N, E]) => (A1, A2)): (AnySet[A1], AnySet[A2])
    Definition Classes
    IterableOps
  297. def unzip3[A1, A2, A3](implicit asTriple: (Param[N, E]) => (A1, A2, A3)): (AnySet[A1], AnySet[A2], AnySet[A3])
    Definition Classes
    IterableOps
  298. val value: GraphLike[N, E, This]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  299. def view: View[Param[N, E]]
    Definition Classes
    IterableOps
  300. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  301. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  302. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  303. def withFilter(p: (Param[N, E]) => Boolean): WithFilter[Param[N, E], [_]AnySet[_]]
    Definition Classes
    IterableOps
  304. def zip[B](that: scala.collection.IterableOnce[B]): AnySet[(Param[N, E], B)]
    Definition Classes
    IterableOps
  305. def zipAll[A1 >: Param[N, E], B](that: Iterable[B], thisElem: A1, thatElem: B): AnySet[(A1, B)]
    Definition Classes
    IterableOps
  306. def zipWithIndex: AnySet[(Param[N, E], Int)]
    Definition Classes
    IterableOps → IterableOnceOps
  307. final def |(that: Set[Param[N, E]]): This[N, E]
    Definition Classes
    SetOps
    Annotations
    @inline()
  308. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toEdgeAssoc[GraphLike[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  309. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] toEdgeAssoc[GraphLike[N, E, This]] 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 GraphLike[N, E, This] toany2stringadd[GraphLike[N, E, This]] 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:
    (graphLike: any2stringadd[GraphLike[N, E, This]]).+(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 GraphLike[N, E, This] 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:
    (graphLike: (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 GraphLike[N, E, This] 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:
    (graphLike: (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 GraphLike[N, E, This] 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:
    (graphLike: (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 GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] 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:
    (graphLike: OuterNode[GraphLike[N, E, This]]).stringPrefix
    Definition Classes
    NodeParam
  6. def toString(): String
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: (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 GraphLike[N, E, This] toOuterNode[GraphLike[N, E, This]] 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:
    (graphLike: OuterNode[GraphLike[N, E, This]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

Deprecated Value Members

  1. def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): This[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]): This[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. final def +=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): GraphLike.this
    Definition Classes
    Growable
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use ++= aka addAll instead of varargs +=; infix operations with an operand of multiple args will be deprecated

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

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

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

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

  7. def -!(elem: Param[N, E]): This[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.

  8. def --!(elems: IterableOnce[Param[N, E]]): This[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.

  9. def -=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): GraphLike.this
    Definition Classes
    Shrinkable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.3) Use --= aka subtractAll instead of varargs -=; infix operations with an operand of multiple args will be deprecated

  10. def /:[B](z: B)(op: (B, Param[N, E]) => B): B
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  11. 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 /:

  12. def :\[B](z: B)(op: (Param[N, E], B) => B): B
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  13. 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 :\

  14. 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.

  15. def collectFirst[B](f: PartialFunction[Param[N, E], B]): Option[B]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

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

    (Since version 2.13.0) Use iterableFactory instead

  17. def copyToBuffer(dest: Buffer[Param[N, E]]): Unit
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  18. 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

  19. def count(f: (Param[N, E]) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  20. def exists(f: (Param[N, E]) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  21. def filter(f: (Param[N, E]) => Boolean): Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  22. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  23. def find(p: (Param[N, E]) => Boolean): Option[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  24. 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 GraphLike[N, E, This] 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:
    (graphLike: 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

  25. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  26. def foldLeft[B](z: B)(op: (B, Param[N, E]) => B): B
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  27. def foldRight[B](z: B)(op: (Param[N, E], B) => B): B
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  28. def forall(f: (Param[N, E]) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  29. def foreach[U](f: (Param[N, E]) => U): Unit
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

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

  31. 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)

  32. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  33. def map[B](f: (Param[N, E]) => B): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: 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

  34. def max(implicit ord: Ordering[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  35. 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 GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  36. def min(implicit ord: Ordering[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  37. 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 GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  38. def mkString: String
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  39. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  40. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  41. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  42. def product(implicit num: Numeric[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  43. 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 GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  44. 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 GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  45. 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 GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  46. 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 GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  47. 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 GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  48. 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 GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  49. final def repr: This[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

  50. def sameElements[B >: A](that: scala.collection.IterableOnce[B]): Boolean
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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

  51. def seq: GraphLike.this
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

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

  52. def size: Int
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  53. def sum(implicit num: Numeric[Param[N, E]]): Param[N, E]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  54. def to[C1](factory: Factory[Param[N, E], C1]): C1
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  55. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  56. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  57. def toIndexedSeq: IndexedSeq[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  58. final def toIterable: Iterable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  59. final def toIterable: GraphLike.this
    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

  60. def toIterator: Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

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

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

  62. def toList: List[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  63. def toMap[K, V](implicit ev: <:<[Param[N, E], (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  64. def toSeq: Seq[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  65. def toSet[B >: A]: Set[B]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  66. def toStream: Stream[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  67. 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

  68. final def toTraversable: Traversable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  69. 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

  70. def toVector: Vector[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

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

  71. 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)

  72. def withFilter(f: (Param[N, E]) => Boolean): Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from GraphLike[N, E, This] 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:
    (graphLike: IterableOnceExtensionMethods[Param[N, E]]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

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

Inherited from Cloneable[Graph[N, E]]

Inherited from Cloneable

Inherited from Shrinkable[Param[N, E]]

Inherited from Growable[Param[N, E]]

Inherited from Clearable

Inherited from collection.GraphLike[N, E, This]

Inherited from GraphDegree[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from GraphAsSet[N, E, This]

Inherited from Set[Param[N, E]]

Inherited from Equals

Inherited from SetOps[Param[N, E], [_]AnySet[_], This[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[_], This[N, E]]

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

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

Inherited from AnyRef

Inherited from Any

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

Inherited by implicit conversion EdgeAssoc fromGraphLike[N, E, This] to EdgeAssoc[GraphLike[N, E, This]]

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

Inherited by implicit conversion anyToNode fromGraphLike[N, E, This] to OuterNode[GraphLike[N, E, This]]

Inherited by implicit conversion ChainingOps fromGraphLike[N, E, This] to ChainingOps[GraphLike[N, E, This]]

Inherited by implicit conversion any2stringadd fromGraphLike[N, E, This] to any2stringadd[GraphLike[N, E, This]]

Inherited by implicit conversion StringFormat fromGraphLike[N, E, This] to StringFormat[GraphLike[N, E, This]]

Inherited by implicit conversion Ensuring fromGraphLike[N, E, This] to Ensuring[GraphLike[N, E, This]]

Inherited by implicit conversion ArrowAssoc fromGraphLike[N, E, This] to ArrowAssoc[GraphLike[N, E, This]]

Ungrouped