Packages

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

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DefaultGraphImpl
  2. GraphTraversalImpl
  3. State
  4. TraverserImpl
  5. AdjacencyListGraph
  6. AdjacencyListBase
  7. Graph
  8. GraphLike
  9. Mutable
  10. EdgeOps
  11. Cloneable
  12. Cloneable
  13. Cloneable
  14. Shrinkable
  15. Growable
  16. Clearable
  17. Graph
  18. GraphLike
  19. GraphDegree
  20. GraphTraversal
  21. GraphBase
  22. Serializable
  23. Serializable
  24. Set
  25. SetLike
  26. Subtractable
  27. GenSet
  28. GenericSetTemplate
  29. GenSetLike
  30. Iterable
  31. IterableLike
  32. Equals
  33. GenIterable
  34. GenIterableLike
  35. Traversable
  36. GenTraversable
  37. GenericTraversableTemplate
  38. TraversableLike
  39. GenTraversableLike
  40. Parallelizable
  41. TraversableOnce
  42. GenTraversableOnce
  43. FilterMonadic
  44. HasNewBuilder
  45. Function1
  46. AnyRef
  47. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by EdgeAssoc
  5. by predicateToNodePredicate
  6. by any2stringadd
  7. by StringFormat
  8. by Ensuring
  9. by ArrowAssoc
  10. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

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

Type Members

  1. trait Edge extends Serializable
    Definition Classes
    GraphBase
  2. class EdgeBase extends InnerEdgeParam[N, E, NodeT, E] with InnerEdge
    Definition Classes
    GraphBase
  3. sealed trait EdgeOrdering extends Ordering[EdgeT] with ElemOrdering
    Definition Classes
    GraphBase
  4. sealed trait ElemOrdering extends AnyRef

    Base trait for graph Orderings.

    Base trait for graph Orderings.

    Attributes
    protected
    Definition Classes
    GraphBase
  5. trait InnerEdge extends Iterable[NodeT] with InnerEdgeParam[N, E, NodeT, E] with Edge with InnerElem
    Definition Classes
    GraphBase
  6. sealed trait InnerElem extends AnyRef
    Definition Classes
    GraphBase
  7. trait Node extends Serializable
    Definition Classes
    GraphBase
  8. 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
  9. trait DegreeFunction extends ((GraphDegree.this)#NodeT) ⇒ Int
    Definition Classes
    GraphDegree
  10. 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
  11. trait Filter [T] extends (T) ⇒ Boolean
    Definition Classes
    GraphDegree
  12. sealed abstract class AbstractTopologicalOrder [+A, +T] extends AbstractTraversable[T]

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

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

    A

    one of NodeT, N

    T

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

    Definition Classes
    GraphTraversal
  13. abstract class Component extends Properties

    Represents a component of this graph.

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

    Definition Classes
    GraphTraversal
  14. trait Cycle extends Path

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

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

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

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

    Definition Classes
    GraphTraversal
  15. trait ExtendedNodeVisitor [U] extends (NodeT) ⇒ U with (NodeT, Int, Int, ⇒ NodeInformer) ⇒ U

    Template for extended node visitors.

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

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

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

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

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

    Represents a topological sort layer.

    Represents a topological sort layer.

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

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

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

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

    one of NodeT, N

    Definition Classes
    GraphTraversal
  19. trait Path extends Walk

    Represents a path in this graph where

    Represents a path in this graph where

    path ::= node { edge node }

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

    Definition Classes
    GraphTraversal
  20. trait Properties extends SubgraphProperties

    Properties controlling traversals.

    Properties controlling traversals.

    Attributes
    protected
    Definition Classes
    GraphTraversal
  21. trait SubgraphProperties extends AnyRef

    Properties controlling the scope of traversals.

    Properties controlling the scope of traversals.

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

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

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

    A

    one of NodeT, N

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

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

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

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

    The root-related methods Traverser will inherit.

    The root-related methods Traverser will inherit.

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

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

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

    Definition Classes
    GraphTraversal
  27. class Weight extends AnyRef

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  30. case class ComponentTraverser (root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphTraversalImpl.this)#NodeFilter, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter, ordering: (GraphTraversalImpl.this)#ElemOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight]) extends (GraphTraversalImpl.this)#ComponentTraverser with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  31. trait DownUpTraverser [A, +This <: (GraphTraversalImpl.this)#DownUpTraverser[A, This]] extends (GraphTraversalImpl.this)#TraverserMethods[A, This] with (GraphTraversalImpl.this)#Impl[A, This]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  32. case class InnerEdgeTraverser (root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#InnerEdgeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#EdgeT, (GraphTraversalImpl.this)#InnerEdgeTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  33. case class InnerElemTraverser (root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#InnerElemTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#InnerElem, (GraphTraversalImpl.this)#InnerElemTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  34. case class InnerNodeDownUpTraverser (root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#InnerNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, (GraphTraversalImpl.this)#NodeT), (GraphTraversalImpl.this)#InnerNodeDownUpTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  35. trait InnerNodeTraversalImpl extends (GraphTraversalImpl.this)#TraverserInnerNode with (GraphTraversalImpl.this)#InnerNodeState
    Definition Classes
    GraphTraversalImpl
  36. case class InnerNodeTraverser (root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#InnerNodeTraverser with (GraphTraversalImpl.this)#Impl[(GraphTraversalImpl.this)#NodeT, (GraphTraversalImpl.this)#InnerNodeTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  37. abstract class LazyPath extends (GraphTraversalImpl.this)#Path

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

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

    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  38. final class MapPathTraversable [T] extends Traversable[T]

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

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

    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  39. class MinWeightEdgeLazyPath extends (GraphTraversalImpl.this)#SimpleLazyPath

    LazyPath with edges selected by minimal weight.

    LazyPath with edges selected by minimal weight.

    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  40. class MultiEdgeLazyCycle extends (GraphTraversalImpl.this)#MultiEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  41. class MultiEdgeLazyPath extends (GraphTraversalImpl.this)#LazyPath

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

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

    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  42. case class OuterEdgeTraverser (root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#OuterEdgeTraverser with (GraphTraversalImpl.this)#Impl[E[N], (GraphTraversalImpl.this)#OuterEdgeTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  43. case class OuterElemTraverser (root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#TraverserMethods[OuterElem[N, E], (GraphTraversalImpl.this)#OuterElemTraverser] with (GraphTraversalImpl.this)#OuterElemTraverser with (GraphTraversalImpl.this)#Impl[OuterElem[N, E], (GraphTraversalImpl.this)#OuterElemTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  44. case class OuterNodeDownUpTraverser (root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#OuterNodeDownUpTraverser with (GraphTraversalImpl.this)#DownUpTraverser[(Boolean, N), (GraphTraversalImpl.this)#OuterNodeDownUpTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  45. case class OuterNodeTraverser (root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters = Parameters(), subgraphNodes: (GraphTraversalImpl.this)#NodeFilter = anyNode, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter = anyEdge, ordering: (GraphTraversalImpl.this)#ElemOrdering = NoOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight] = None) extends (GraphTraversalImpl.this)#OuterNodeTraverser with (GraphTraversalImpl.this)#Impl[N, (GraphTraversalImpl.this)#OuterNodeTraverser] with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  46. class PathBuilder extends (GraphTraversalImpl.this)#WalkBuilder with (GraphTraversalImpl.this)#PathBuilder
    Definition Classes
    GraphTraversalImpl
  47. final class ReverseStackTraversable [S, T] extends Traversable[T]

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

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

    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  48. abstract class SimpleLazyPath extends (GraphTraversalImpl.this)#LazyPath

    LazyPath with deferred edges selection.

    LazyPath with deferred edges selection.

    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  49. class StrongComponentImpl extends (GraphTraversalImpl.this)#Component
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  50. case class StrongComponentTraverser (root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphTraversalImpl.this)#NodeFilter, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter, ordering: (GraphTraversalImpl.this)#ElemOrdering, maxWeight: Option[(GraphTraversalImpl.this)#Weight]) extends (GraphTraversalImpl.this)#StrongComponentTraverser with Product with Serializable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  51. class WalkBuilder extends (GraphTraversalImpl.this)#WalkBuilder
    Definition Classes
    GraphTraversalImpl
  52. class WeakComponentImpl extends (GraphTraversalImpl.this)#Component
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  53. trait InnerNodeState extends AnyRef
    Definition Classes
    State
  54. trait Impl [A, +This <: GraphTraversalImpl.Traverser[A, This] with GraphTraversalImpl.Impl[A, This]] extends GraphTraversalImpl.TraverserMethods[A, This] with GraphTraversalImpl.Traverser[A, This]
    Attributes
    protected[scalax.collection]
    Definition Classes
    TraverserImpl
  55. trait InnerNode extends (AdjacencyListBase.this)#InnerNode
    Definition Classes
    AdjacencyListBase
  56. class EdgeImpl extends This.EdgeBase
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()
  57. class EdgeSet extends This.EdgeSet with This.EdgeSet
    Definition Classes
    AdjacencyListGraph
  58. abstract class InnerNodeImpl extends This.NodeBase with This.InnerNode with This.InnerNode
    Definition Classes
    AdjacencyListGraph
  59. class NodeSet extends This.NodeSet with This.NodeSet
    Definition Classes
    AdjacencyListGraph
  60. type Config = CoreConfig
    Attributes
    protected
    Definition Classes
    DefaultGraphImplAdjacencyListBaseGraphLike
  61. type CycleNodeOrTopologicalOrder = Either[NodeT, TopologicalOrder[NodeT]]

    Either a Right containing a valid topological order or a Left containing a node on a cycle.

    Either a Right containing a valid topological order or a Left containing a node on a cycle.

    Definition Classes
    GraphTraversal
  62. type CycleStackElem = (NodeT, Iterable[EdgeT])
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  63. type DegreeNodeSeqEntry = (Int, NodeT)

    Type alias for entries in degree maps returned by degreeSeqMap.

    Type alias for entries in degree maps returned by degreeSeqMap.

    Definition Classes
    GraphDegree
  64. type EdgeFilter = (EdgeT) ⇒ Boolean
    Definition Classes
    GraphBase
  65. type EdgeSetT = EdgeSet
  66. type EdgeT = EdgeImpl
    Definition Classes
    AdjacencyListGraphGraphBase
  67. type Layers = Traversable[Layer]

    The result of a topological sort in the layered view.

    The result of a topological sort in the layered view.

    Definition Classes
    GraphTraversal
  68. final class NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl
    Attributes
    protected
    Annotations
    @SerialVersionUID()
  69. type NodeFilter = (NodeT) ⇒ Boolean
    Definition Classes
    GraphBase
  70. type NodeSetT = NodeSet
  71. type NodeT = NodeBase
  72. type Self = DefaultGraphImpl[N, E]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  73. type ThisGraph = DefaultGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
  74. type TopoSortSetup = (Buffer[NodeT], Map[NodeT, Int], Option[NodeT])
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  75. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike
  76. trait InnerNodeOps extends AnyRef
    Definition Classes
    EdgeOps

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 ExtendedNodeVisitor
    Definition Classes
    GraphTraversal
  15. object Path extends Serializable
    Definition Classes
    GraphTraversal
  16. object SubgraphProperties
    Attributes
    protected
    Definition Classes
    GraphTraversal
  17. object TraverserInnerNode extends Serializable
    Definition Classes
    GraphTraversal
    Annotations
    @transient()
  18. object Walk
    Definition Classes
    GraphTraversal
  19. object Weight
    Definition Classes
    GraphTraversal
  20. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  21. final def ##(): Int
    Definition Classes
    AnyRef → Any
  22. def &(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GenSetLike
  23. def &=(coll: Iterable[Param[N, E]]): DefaultGraphImpl.this.type

    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.

    Definition Classes
    GraphLike
  24. def &~(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GenSetLike
  25. def +(node: N): DefaultGraphImpl[N, E]

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

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

    node

    the node to be added

    returns

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

    Definition Classes
    GraphLikeGraphLike
  26. def +(elem: Param[N, E]): DefaultGraphImpl[N, E]

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

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

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

    elem

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

    returns

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

    Definition Classes
    GraphLike → SetLike → GenSetLike
  27. def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[N, E]
    Definition Classes
    SetLike
  28. final def +#(edge: E[N]): DefaultGraphImpl[N, E]

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

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

    edge

    the edge to be added

    returns

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

    Attributes
    protected
    Definition Classes
    GraphLikeGraphLike
    Annotations
    @inline()
  29. def ++(elems: GenTraversableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike → SetLike
  30. def ++[B >: Param[N, E], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  31. def ++:[B >: Param[N, E], That](that: Traversable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike
  32. def ++:[B >: Param[N, E], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike
  33. def ++=(xs: TraversableOnce[Param[N, E]]): DefaultGraphImpl.this.type
    Definition Classes
    GraphLike → Growable
  34. def +=(elem: Param[N, E]): DefaultGraphImpl.this.type
    Definition Classes
    GraphLike → Growable
  35. final def +=(node: N): DefaultGraphImpl.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  36. def +=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl.this.type
    Definition Classes
    Growable
  37. final def +=#(edge: E[N]): DefaultGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    AdjacencyListGraphGraphLike
    Annotations
    @inline()
  38. final def +~%+=[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): DefaultGraphImpl.this.type

    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()
  39. final def +~%+=[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): DefaultGraphImpl.this.type

    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()
  40. final def +~%=[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): DefaultGraphImpl.this.type

    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()
  41. final def +~%=[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): DefaultGraphImpl.this.type

    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()
  42. final def +~+=[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): DefaultGraphImpl.this.type

    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()
  43. final def +~+=[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): DefaultGraphImpl.this.type

    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()
  44. final def +~=(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): DefaultGraphImpl.this.type

    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()
  45. final def +~=(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): DefaultGraphImpl.this.type

    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()
  46. final def -(edge: E[N]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  47. final def -(node: N): DefaultGraphImpl[N, E]

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

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

    node

    the node to be removed.

    returns

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

    Definition Classes
    GraphLikeGraphLike
    Annotations
    @inline()
  48. def -(elem: Param[N, E]): DefaultGraphImpl[N, E]

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

    Creates a new subgraph consisting of all nodes and edges of this graph except elem. If elem is of type N, this method maps to -(node: N). Otherwise the edge is deleted 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 → SetLike → Subtractable → GenSetLike
  49. def -(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl[N, E]
    Definition Classes
    Subtractable
  50. final def -!(edge: E[N]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  51. def -!(elem: Param[N, E]): DefaultGraphImpl[N, E]

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

    Creates a new subgraph consisting of all nodes and edges of this graph except elem. If elem is of type N, this method maps to -(node: N). Otherwise the edge is deleted along with those incident nodes which would become edge-less 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
  52. final def -!#(edge: E[N]): DefaultGraphImpl[N, E]

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

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

    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()
  53. def -!=(elem: Param[N, E]): DefaultGraphImpl.this.type
    Definition Classes
    GraphLike
  54. final def -!=#(edge: E[N]): DefaultGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  55. final def -#(edge: E[N]): DefaultGraphImpl[N, E]

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

    Creates a new subgraph consisting of all nodes and edges of this graph but 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
    GraphLikeGraphLike
    Annotations
    @inline()
  56. def --(elems: GenTraversableOnce[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GraphLike → Subtractable
  57. def --!(elems: GenTraversableOnce[Param[N, E]]): DefaultGraphImpl[N, E]

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

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

    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
  58. final def --!=(coll: Iterable[Param[N, E]]): DefaultGraphImpl[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.

    Definition Classes
    GraphLike
    Annotations
    @inline()
  59. def --=(xs: TraversableOnce[Param[N, E]]): DefaultGraphImpl.this.type
    Definition Classes
    Shrinkable
  60. def -=(elem: Param[N, E]): DefaultGraphImpl.this.type
    Definition Classes
    GraphLike → Shrinkable
  61. final def -=(node: N): DefaultGraphImpl.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  62. def -=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): DefaultGraphImpl.this.type
    Definition Classes
    Shrinkable
  63. final def -=#(edge: E[N]): DefaultGraphImpl.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  64. def ->[B](y: B): (DefaultGraphImpl[N, E], B)
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to ArrowAssoc[DefaultGraphImpl[N, E]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  65. final def -?(node: N): DefaultGraphImpl[N, E]

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

    Creates a new subgraph consisting of all nodes and edges of this graph but 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()
  66. final def -?=(node: N): DefaultGraphImpl.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  67. def /:[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. def :\[B](z: B)(op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  70. final def add(edge: E[N]): Boolean
    Definition Classes
    AdjacencyListGraphGraphLike
    Annotations
    @inline()
  71. final def add(node: N): Boolean

    Adds a node to this graph.

    Adds a node to this graph.

    returns

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

    Definition Classes
    AdjacencyListGraphGraphLike
    Annotations
    @inline()
  72. final def addAndGet(edge: E[N]): 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.

    Definition Classes
    GraphLike
    Annotations
    @inline()
  73. final def addAndGet(node: N): 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.

    Definition Classes
    GraphLike
    Annotations
    @inline()
  74. def addAndGetEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): 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
  75. final def addAndGetEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): 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()
  76. def addAndGetLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): 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
  77. final def addAndGetLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): 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()
  78. def addAndGetWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: N, node_2: N, nodes: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): 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
  79. final def addAndGetWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: N, node_2: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): 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()
  80. def addAndGetWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): 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
  81. final def addAndGetWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: N, node_2: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): 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()
  82. 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()
  83. 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()
  84. final def addLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], 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()
  85. final def addLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], 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()
  86. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  87. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  88. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  89. final def addWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](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()
  90. final def addWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](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()
  91. final def addWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], 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()
  92. final def addWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], 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()
  93. def aggregate[B](z: ⇒ B)(seqop: (B, Param[N, E]) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def andThen[A](g: (Boolean) ⇒ A): (Param[N, E]) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  95. final val anyEdge: EdgeFilter

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

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

    Definition Classes
    GraphBase
  96. final def anyEdgeSelector(from: NodeT, to: NodeT): Option[EdgeT]

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

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

    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  97. final val anyNode: NodeFilter

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

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

    Definition Classes
    GraphBase
  98. final lazy val anyOrdering: AnyOrdering[N]
    Attributes
    protected
    Definition Classes
    GraphBase
  99. def apply(elem: Param[N, E]): Boolean
    Definition Classes
    GenSetLike → Function1
  100. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  101. def asSortedString(nodeSeparator: String = GraphBase.defaultSeparator, edgeSeparator: String = GraphBase.defaultSeparator, nodesEdgesSeparator: String = GraphBase.defaultSeparator, withNodesEdgesPrefix: Boolean = false)(implicit ordNode: NodeOrdering = defaultNodeOrdering, ordEdge: EdgeOrdering = defaultEdgeOrdering): String

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

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

    nodeSeparator

    to separate nodes by.

    edgeSeparator

    to separate edges by.

    nodesEdgesSeparator

    to separate nodes from edges by.

    withNodesEdgesPrefix

    whether the node and edge set should be prefixed.

    ordNode

    the node ordering defaulting to defaultNodeOrdering.

    ordEdge

    the edge ordering defaulting to defaultEdgeOrdering.

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

    Prepares and calls plusPlus or minusMinus.

    Prepares and calls plusPlus or minusMinus.

    Attributes
    protected
    Definition Classes
    GraphLike
  103. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  104. final def clear(): Unit
    Definition Classes
    AdjacencyListGraph → Growable → Clearable
    Annotations
    @inline()
  105. def clearNodeStates(flags: FlagWord, flagsExt: ExtBitSet): Unit
    Attributes
    protected
    Definition Classes
    State
  106. final def clone(): DefaultGraphImpl.this.type
    Definition Classes
    DefaultGraphImplGraphLike → Cloneable → AnyRef
  107. def collect[B, That](pf: PartialFunction[Param[N, E], B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
    Definition Classes
    TraversableOnce
  109. def companion: GenericCompanion[Set]
    Definition Classes
    Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  110. def componentTraverser(parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): ComponentTraverser

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

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

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

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

    Definition Classes
    GraphTraversalImplGraphTraversal
  111. def compose[A](g: (A) ⇒ Param[N, E]): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  112. implicit val config: DefaultGraphImpl.Config with AdjacencyListArrayConfig
    Definition Classes
    DefaultGraphImplGraphLike
  113. 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 → SetLike → GenSetLike
  114. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  115. def copyToArray[B >: Param[N, E]](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  118. def count(p: (Param[N, E]) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. final def cycle(results: (Option[NodeT], ArrayStack[CycleStackElem]), edgeFilter: EdgeFilter): Option[Cycle]
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  120. final lazy val defaultEdgeOrdering: EdgeOrdering
    Definition Classes
    GraphBase
  121. final lazy val defaultNodeOrdering: NodeOrdering
    Definition Classes
    GraphBase
  122. final def defaultPathSize: Int
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  123. def degreeCount(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): SortedMap[Int, Int]

    The degree set of this graph projected onto a map.

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

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

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

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

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

    The degree set of this graph projected onto a map.

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

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

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

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

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

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

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

    Definition Classes
    GraphDegree
  128. def diff(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetLike → GenSetLike
  129. def drop(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  130. def dropRight(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike
  131. def dropWhile(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  132. def dump(store: FlagStore): ExtBitSet
    Attributes
    protected
    Definition Classes
    State
  133. def dumpDirty: ExtBitSet

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

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

    Definition Classes
    State
  134. def dumpInUse: ExtBitSet

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

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

    Definition Classes
    State
  135. def edgeIterator: GroupIterator[EdgeT] { ... /* 2 definitions in type refinement */ }
    Definition Classes
    AdjacencyListBase
  136. implicit val edgeT: ClassTag[E[N]]
    Definition Classes
    DefaultGraphImplGraphLike
  137. implicit final def edgeToEdgeCont(e: E[N]): E[NodeT]
    Attributes
    protected
    Definition Classes
    GraphBase
  138. final def edges: EdgeSetT

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

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

    returns

    Set of all contained edges.

    Definition Classes
    DefaultGraphImplAdjacencyListGraphGraphBase
    Annotations
    @inline()
  139. final def empty: DefaultGraphImpl[N, E]
    Definition Classes
    DefaultGraphImplGraphGraph → SetLike → GenericSetTemplate
  140. def ensuring(cond: (DefaultGraphImpl[N, E]) ⇒ Boolean, msg: ⇒ Any): DefaultGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to Ensuring[DefaultGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  141. def ensuring(cond: (DefaultGraphImpl[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to Ensuring[DefaultGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  142. def ensuring(cond: Boolean, msg: ⇒ Any): DefaultGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to Ensuring[DefaultGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  143. def ensuring(cond: Boolean): DefaultGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to Ensuring[DefaultGraphImpl[N, E]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  144. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  145. 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 → GenSetLike → Equals → AnyRef → Any
  146. def exists(p: (Param[N, E]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  147. final def expectedMaxNodes(divisor: Int, min: Int = 128): Int
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  148. def filter(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  149. def filterNot(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  150. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  151. final def find(outerEdge: E[N]): Option[EdgeT]

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

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

    outerEdge

    the outer edge to search for in this graph.

    returns

    Some of the inner edge found or None.

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

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

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

    returns

    Some of the inner node found or None.

    Definition Classes
    GraphLike
    Annotations
    @inline()
  153. def find(p: (Param[N, E]) ⇒ Boolean): Option[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  154. final def findCycle[U](implicit visitor: (InnerElem) ⇒ U = empty): Option[Cycle]

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

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

    Definition Classes
    GraphTraversal
  155. def flatMap[B, That](f: (Param[N, E]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  156. def flatten[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  157. def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  158. def foldLeft[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  159. def foldRight[B](z: B)(op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  160. final def forInDegrees(traversable: Traversable[NodeT] with SubgraphProperties, maybeHandle: Option[Handle] = None, includeAnyway: Option[NodeT] = None, includeInDegree: NodeFilter = anyNode, fillInDegrees: Boolean = true): TopoSortSetup

    Calculates in-degrees of nodes spanned by traversable.

    Calculates in-degrees of nodes spanned by traversable.

    traversable

    supplies the nodes for which the degree is to be calculated

    maybeHandle

    to be used to mark visited nodes

    includeAnyway

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

    includeInDegree

    optionally filters predecessor nodes when calculation the in degree

    returns

    triple of

    1. nodes without predecessors in the component spanned by traverser
    2. map of visited nodes to their in degrees
    3. size of traversable
    Attributes
    protected
    Definition Classes
    GraphTraversalImpl
  161. def forall(p: (Param[N, E]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  162. def foreach[U](f: (Param[N, E]) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  163. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to StringFormat[DefaultGraphImpl[N, E]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  164. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  165. final def get(outerEdge: E[N]): EdgeT

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

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

    outerEdge

    the outer edge to search for in this graph.

    returns

    the inner edge if found. Otherwise NoSuchElementException is thrown.

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

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

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

    outerNode

    the outer node to search for in this graph.

    returns

    the inner node if found. Otherwise NoSuchElementException is thrown.

    Definition Classes
    GraphLike
    Annotations
    @inline()
  167. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  168. final def getOrElse(outerEdge: E[N], default: EdgeT): EdgeT

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

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

    outerEdge

    the outer edge to search for in this graph.

    default

    the inner edge to return if outerEdge cannot be found.

    returns

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

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

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

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

    outerNode

    the outer node to search for in this graph.

    default

    the inner node to return if outerNode is not contained.

    returns

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

    Definition Classes
    GraphLike
    Annotations
    @inline()
  170. final val graphCompanion: DefaultGraphImpl.type
    Definition Classes
    DefaultGraphImplGraphLike
  171. 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
  172. def groupBy[K](f: (Param[N, E]) ⇒ K): Map[K, DefaultGraphImpl[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  173. def grouped(size: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike
  174. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  175. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  176. def having(node: NodeFilter = _ => false, edge: EdgeFilter = null): PartialFunction[Param[N, E], Boolean]

    Provides a shortcut for predicates involving any graph element.

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

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

    The predicate that must hold for the nodes.

    edge

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

    returns

    A partial function combining the passed predicates.

    Definition Classes
    GraphLike
  177. def head: Param[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  178. def headOption: Option[Param[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  179. def init: DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  180. def initialize(nodes: Traversable[N], edges: Traversable[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
  181. def initializeFrom(in: ObjectInputStream, nodes: NodeSetT, edges: EdgeSetT): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  182. def inits: Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    TraversableLike
  183. def innerEdgeTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): InnerEdgeTraverser

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

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

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    Definition Classes
    GraphTraversalImplGraphTraversal
  184. def innerElemTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): InnerElemTraverser

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

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

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

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

    Definition Classes
    GraphTraversalImplGraphTraversal
  185. def innerNodeDownUpTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): InnerNodeDownUpTraverser

    Creates a InnerNodeDownUpTraverser based on scala.collection.Traversable[(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.Traversable[(Boolean, NodeT)] where the Boolean parameter is true if the traversal takes place in downward and false if it takes place in upward direction.

    root

    The node where subsequent graph traversals start.

    parameters

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

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

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

    Definition Classes
    GraphTraversalImplGraphTraversal
  186. def innerNodeTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): InnerNodeTraverser

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

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

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

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

    Definition Classes
    GraphTraversalImplGraphTraversal
  187. def intersect(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GenSetLike
  188. final def isAcyclic: Boolean

    Whether this graph has no cycle.

    Whether this graph has no cycle.

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

    true if f is not equivalent to anyEdge.

    true if f is not equivalent to anyEdge.

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

    true if f is not equivalent to anyNode.

    true if f is not equivalent to anyNode.

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

    Whether all edges of this graph are directed.

    Whether all edges of this graph are directed.

    Definition Classes
    GraphLikeGraphBase
  196. final val isDirectedT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  197. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  198. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  199. def isHyper: Boolean

    Whether this graph contains at least one hyperedges.

    Whether this graph contains at least one hyperedges.

    Definition Classes
    GraphLikeGraphBase
  200. final val isHyperT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  201. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  202. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  203. 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
  204. final val isMultiT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  205. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  206. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  207. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  208. 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()
  209. def iterator: Iterator[OutParam[N, E] with Serializable with InnerElem]

    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 → GenSetLike → IterableLike → GenIterableLike
  210. def last: Param[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  211. def lastOption: Option[Param[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  212. def map[B, That](f: (Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike → FilterMonadic
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.

  213. def max[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  214. def maxBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  215. def maxDegree(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Int

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

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

    Definition Classes
    GraphDegree
  216. def min[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  217. def minBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  218. def minDegree(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Int

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

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

    Definition Classes
    GraphDegree
  219. def minusMinus(delNodes: Traversable[N], delEdges: Traversable[E[N]]): DefaultGraphImpl[N, E]

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

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

    Attributes
    protected
    Definition Classes
    GraphLike
  220. def minusMinusNodesEdges(delNodes: Traversable[N], delEdges: Traversable[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
  221. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  222. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  223. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  224. val n1: DefaultGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to EdgeAssoc[DefaultGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  225. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  226. def newBuilder: GraphBuilder[N, E, DefaultGraphImpl]
    Attributes
    protected[this]
    Definition Classes
    DefaultGraphImpl → SetLike → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  227. final def newEdge(innerEdge: E[NodeT]): EdgeT
    Attributes
    protected
    Definition Classes
    AdjacencyListGraphGraphBase
    Annotations
    @inline()
  228. final def newEdgeTArray(size: Int): Array[EdgeT]
    Definition Classes
    AdjacencyListGraphAdjacencyListBase
    Annotations
    @inline()
  229. final def newNode(n: N): NodeT
    Attributes
    protected
    Definition Classes
    AdjacencyListBaseGraphBase
    Annotations
    @inline()
  230. final def newNodeSet: NodeSetT
    Attributes
    protected
    Definition Classes
    DefaultGraphImplAdjacencyListBase
    Annotations
    @inline()
  231. final def newNodeWithHints(n: N, h: Hints): NodeBase
    Attributes
    protected
    Definition Classes
    DefaultGraphImplAdjacencyListBase
    Annotations
    @inline()
  232. def newPathBuilder(start: NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): PathBuilder

    Instantiates a PathBuilder for this graph.

    Instantiates a PathBuilder for this graph.

    start

    The node this path starts at.

    sizeHint

    Expected maximum number of nodes on this path.

    edgeSelector

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

    Definition Classes
    GraphTraversalImplGraphTraversal
  233. def newWalkBuilder(start: NodeT)(implicit sizeHint: Int = defaultPathSize, edgeSelector: (NodeT, NodeT) ⇒ Option[EdgeT]): WalkBuilder

    Instantiates a WalkBuilder for this graph.

    Instantiates a WalkBuilder for this graph.

    start

    The node this walk starts at.

    sizeHint

    Expected maximum number of nodes on this walk.

    edgeSelector

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

    Definition Classes
    GraphTraversalImplGraphTraversal
  234. def nextHandle: Handle

    Avoid calling this directly, prefer withHandle instead.

    Avoid calling this directly, prefer withHandle instead.

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

    Node predicate always returning false.

    Node predicate always returning false.

    Definition Classes
    GraphBase
  236. final def nodes: NodeSetT

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

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

    returns

    Set of all contained nodes.

    Definition Classes
    DefaultGraphImplAdjacencyListGraphGraphBase
    Annotations
    @inline()
  237. def nodesToCEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with CHyperEdgeBound[_, EE]](factory: CHyperEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[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[scalax.collection]
    Definition Classes
    EdgeOps
  238. def nodesToCEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with CEdgeBound[_, EE]](factory: CEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N): E[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[scalax.collection]
    Definition Classes
    EdgeOps
  239. final def nodesToEdge(edgeFactory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit endpointsKind: CollectionKind): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  240. final def nodesToEdge(edgeFactory: EdgeCompanion[E], node_1: N, node_2: N): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  241. def nodesToEdgeCont(factory: EdgeCompanion[E], node_1: N, node_2: N): E[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[scalax.collection]
    Definition Classes
    EdgeOps
  242. def nodesToEdgeCont(factory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[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[scalax.collection]
    Definition Classes
    EdgeOps
  243. final def nodesToLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](edgeFactory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  244. final def nodesToLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](edgeFactory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  245. def nodesToLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](factory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): E[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[scalax.collection]
    Definition Classes
    EdgeOps
  246. def nodesToLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](factory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind = Bag): E[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[scalax.collection]
    Definition Classes
    EdgeOps
  247. final def nodesToWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](edgeFactory: WHyperEdgeCompanion[EE], weight: Double, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  248. final def nodesToWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](edgeFactory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  249. def nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](factory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): E[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[scalax.collection]
    Definition Classes
    EdgeOps
  250. def nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](factory: WHyperEdgeCompanion[EE], weight: Double, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[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[scalax.collection]
    Definition Classes
    EdgeOps
  251. final def nodesToWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](edgeFactory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  252. final def nodesToWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](edgeFactory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N): EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  253. def nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](factory: WLEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N): E[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[scalax.collection]
    Definition Classes
    EdgeOps
  254. def nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](factory: WLHyperEdgeCompanion[EE], weight: Double, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[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[scalax.collection]
    Definition Classes
    EdgeOps
  255. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  256. 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()
  257. final def notify(): Unit
    Definition Classes
    AnyRef
  258. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  259. 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
  260. def outerEdgeTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): OuterEdgeTraverser

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

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

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

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

    Definition Classes
    GraphTraversalImplGraphTraversal
  261. def outerElemTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): OuterElemTraverser

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

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

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

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

    Definition Classes
    GraphTraversalImplGraphTraversal
  262. def outerNodeDownUpTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): OuterNodeDownUpTraverser

    Creates a OuterNodeDownUpTraverser based on scala.collection.Traversable[(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.Traversable[(Boolean, N)] where the Boolean parameter is true if the traversal takes place in downward and false if it takes place in upward direction.

    root

    The node where subsequent graph traversals start.

    parameters

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

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    Definition Classes
    GraphTraversalImplGraphTraversal
  263. def outerNodeTraverser(root: NodeT, parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): OuterNodeTraverser

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

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

    root

    The node where subsequent graph traversals start.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

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

    Definition Classes
    GraphTraversalImplGraphTraversal
  264. def par: ParSet[Param[N, E]]
    Definition Classes
    Parallelizable
  265. def parCombiner: Combiner[Param[N, E], ParSet[Param[N, E]]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  266. final def partition(elems: GenTraversableOnce[Param[N, E]]): Partitions[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  267. def partition(p: (Param[N, E]) ⇒ Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  268. def plusPlus(newNodes: Traversable[N], newEdges: Traversable[E[N]]): DefaultGraphImpl[N, E]

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

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

    Attributes
    protected
    Definition Classes
    GraphLike
  269. def product[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  270. def reduce[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  271. def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce
  272. def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  273. def reduceOption[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  274. def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  275. def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  276. def releaseHandle(handle: Handle): Unit

    Avoid calling this directly, prefer withHandle instead.

    Avoid calling this directly, prefer withHandle instead.

    Attributes
    protected
    Definition Classes
    State
  277. final def remove(edge: E[N]): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  278. final def remove(node: N): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  279. final def removeGently(node: N): Boolean
    Definition Classes
    GraphLike
  280. final def removeWithNodes(edge: E[N]): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  281. def repr: DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  282. def reversed: List[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  283. def sameElements[B >: Param[N, E]](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  284. def scan[B >: Param[N, E], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  285. def scanLeft[B, That](z: B)(op: (B, Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  286. def scanRight[B, That](z: B)(op: (Param[N, E], B) ⇒ B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  287. def seq: Set[Param[N, E]]
    Definition Classes
    Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  288. final def serializeTo(out: ObjectOutputStream): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  289. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  290. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  291. def slice(from: Int, until: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  292. def sliding(size: Int, step: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike
  293. def sliding(size: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike
  294. def span(p: (Param[N, E]) ⇒ Boolean): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  295. def splitAt(n: Int): (DefaultGraphImpl[N, E], DefaultGraphImpl[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  296. def stringPrefix: String
    Definition Classes
    GraphLike → SetLike → TraversableLike → GenTraversableLike
  297. def strongComponentTraverser(parameters: Parameters = Parameters(), subgraphNodes: NodeFilter = anyNode, subgraphEdges: EdgeFilter = anyEdge, ordering: ElemOrdering = NoOrdering, maxWeight: Option[Weight] = None): StrongComponentTraverser

    Creates a StrongComponentTraverser.

    parameters

    The properties controlling subsequent traversals.

    subgraphNodes

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

    subgraphEdges

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

    ordering

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

    maxWeight

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

    Definition Classes
    GraphTraversalImplGraphTraversal
  298. def subsetOf(that: GenSet[Param[N, E]]): Boolean
    Definition Classes
    GenSetLike
  299. def subsets(): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    SetLike
  300. def subsets(len: Int): Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    SetLike
  301. def sum[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  302. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  303. def tail: DefaultGraphImpl[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  304. def tails: Iterator[DefaultGraphImpl[N, E]]
    Definition Classes
    TraversableLike
  305. def take(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  306. def takeRight(n: Int): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike
  307. def takeWhile(p: (Param[N, E]) ⇒ Boolean): DefaultGraphImpl[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  308. def thisCollection: Iterable[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  309. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[N, E], Col[Param[N, E]]]): Col[Param[N, E]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  310. def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  311. def toBuffer[A1 >: Param[N, E]]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  312. def toCollection(repr: DefaultGraphImpl[N, E]): Iterable[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  313. def toIndexedSeq: IndexedSeq[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  314. def toIterable: Iterable[Param[N, E]]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  315. def toIterator: Iterator[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  316. def toList: List[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  317. def toMap[T, U](implicit ev: <:<[Param[N, E], (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  318. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to CollectionsHaveToParArray[DefaultGraphImpl[N, E], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (DefaultGraphImpl[N, E]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  319. def toSeq: Seq[Param[N, E]]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  320. def toSet[B >: Param[N, E]]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  321. def toSortedString(nodeSeparator: String = GraphBase.defaultSeparator, edgeSeparator: String = GraphBase.defaultSeparator, nodesEdgesSeparator: String = GraphBase.defaultSeparator, withNodesEdgesPrefix: Boolean = false)(implicit ordNode: NodeOrdering = defaultNodeOrdering, ordEdge: EdgeOrdering = defaultEdgeOrdering): String

    Same as asSortedString but additionally prefixed and parenthesized by stringPrefix.

    Same as asSortedString but additionally prefixed and parenthesized by stringPrefix.

    Definition Classes
    GraphLike
  322. def toStream: Stream[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  323. 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 → SetLike → Function1 → TraversableLike → AnyRef → Any
  324. def toTraversable: Traversable[Param[N, E]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  325. def toVector: Vector[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  326. final def topologicalSort[U](implicit visitor: (InnerElem) ⇒ U = empty): CycleNodeOrTopologicalOrder

    Sorts this graph topologically.

    Sorts this graph topologically.

    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
  327. final def topologicalSortByComponent[U](implicit visitor: (InnerElem) ⇒ U = empty): Traversable[CycleNodeOrTopologicalOrder]

    Sorts every isolated component of this graph topologically.

    Sorts every isolated component of this graph topologically.

    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
  328. def totalDegree(implicit nodeDegree: DegreeFunction = Degree, degreeFilter: (Int) ⇒ Boolean = AnyDegree): Int

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

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

    nodeDegree

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

    degreeFilter

    selects nodes to be included by their degree.

    Definition Classes
    GraphDegree
  329. def totalWeight: Double
    Definition Classes
    GraphBase
  330. def transpose[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[Set[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  331. def union(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    SetLike → GenSetLike
  332. def unzip[A1, A2](implicit asPair: (Param[N, E]) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  333. def unzip3[A1, A2, A3](implicit asTriple: (Param[N, E]) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  334. final 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.

    Definition Classes
    AdjacencyListGraphGraphLike
    Annotations
    @inline()
  335. val value: DefaultGraphImpl[N, E]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  336. def view(from: Int, until: Int): IterableView[Param[N, E], DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike → TraversableLike
  337. def view: IterableView[Param[N, E], DefaultGraphImpl[N, E]]
    Definition Classes
    IterableLike → TraversableLike
  338. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  339. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  340. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  341. def withFilter(p: (Param[N, E]) ⇒ Boolean): FilterMonadic[Param[N, E], DefaultGraphImpl[N, E]]
    Definition Classes
    TraversableLike → FilterMonadic
  342. def withHandle[T](reuse: Option[Handle] = None)(block: (Handle) ⇒ T): T

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

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

    returns

    The result of the code block executed.

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

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

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

    returns

    The result of the code block executed.

    Attributes
    protected
    Definition Classes
    State
  344. def zip[A1 >: Param[N, E], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  345. def zipAll[B, A1 >: Param[N, E], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  346. def zipWithIndex[A1 >: Param[N, E], That](implicit bf: CanBuildFrom[DefaultGraphImpl[N, E], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  347. def |(that: GenSet[Param[N, E]]): DefaultGraphImpl[N, E]
    Definition Classes
    GenSetLike
  348. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to EdgeAssoc[DefaultGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  349. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to EdgeAssoc[DefaultGraphImpl[N, E]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  350. def [B](y: B): (DefaultGraphImpl[N, E], B)
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to ArrowAssoc[DefaultGraphImpl[N, E]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to any2stringadd[DefaultGraphImpl[N, E]] performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (defaultGraphImpl: any2stringadd[DefaultGraphImpl[N, E]]).+(other)
    Definition Classes
    any2stringadd
  2. def andThen[A](g: (Boolean) ⇒ A): (Param[Param[N, E], EI]) ⇒ A
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (defaultGraphImpl: (Param[Param[N, E], EI]) ⇒ Boolean).andThen(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def apply(v1: Param[Param[N, E], EI]): Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (defaultGraphImpl: (Param[Param[N, E], EI]) ⇒ Boolean).apply(v1)
    Definition Classes
    Function1
  4. def compose[A](g: (A) ⇒ Param[Param[N, E], EI]): (A) ⇒ Boolean
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (defaultGraphImpl: (Param[Param[N, E], EI]) ⇒ Boolean).compose(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. def filter(p: (Param[N, E]) ⇒ Boolean): TraversableOnce[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (defaultGraphImpl: MonadOps[Param[N, E]]).filter(p)
    Definition Classes
    MonadOps
  6. def flatMap[B](f: (Param[N, E]) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (defaultGraphImpl: MonadOps[Param[N, E]]).flatMap(f)
    Definition Classes
    MonadOps
  7. def map[B](f: (Param[N, E]) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (defaultGraphImpl: MonadOps[Param[N, E]]).map(f)
    Definition Classes
    MonadOps
  8. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (defaultGraphImpl: OuterNode[DefaultGraphImpl[N, E]]).stringPrefix
    Definition Classes
    NodeParam
  9. def toString(): String
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to OuterNode[DefaultGraphImpl[N, E]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (defaultGraphImpl: OuterNode[DefaultGraphImpl[N, E]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  10. def toString(): String
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (defaultGraphImpl: (Param[Param[N, E], EI]) ⇒ Boolean).toString()
    Definition Classes
    Function1 → AnyRef → Any
  11. def withFilter(p: (Param[N, E]) ⇒ Boolean): Iterator[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from DefaultGraphImpl[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (defaultGraphImpl: MonadOps[Param[N, E]]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from GraphTraversalImpl[N, E]

Inherited from State[N, E]

Inherited from TraverserImpl[N, E]

Inherited from AdjacencyListGraph[N, E, DefaultGraphImpl]

Inherited from AdjacencyListBase[N, E, DefaultGraphImpl]

Inherited from Graph[N, E]

Inherited from GraphLike[N, E, DefaultGraphImpl]

Inherited from Mutable

Inherited from EdgeOps[N, E, DefaultGraphImpl]

Inherited from Cloneable[Graph[N, E]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[Param[N, E]]

Inherited from Growable[Param[N, E]]

Inherited from Clearable

Inherited from collection.Graph[N, E]

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

Inherited from GraphDegree[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from Serializable

Inherited from Set[Param[N, E]]

Inherited from SetLike[Param[N, E], DefaultGraphImpl[N, E]]

Inherited from Subtractable[Param[N, E], DefaultGraphImpl[N, E]]

Inherited from GenSet[Param[N, E]]

Inherited from GenericSetTemplate[Param[N, E], Set]

Inherited from GenSetLike[Param[N, E], DefaultGraphImpl[N, E]]

Inherited from Iterable[Param[N, E]]

Inherited from IterableLike[Param[N, E], DefaultGraphImpl[N, E]]

Inherited from Equals

Inherited from GenIterable[Param[N, E]]

Inherited from GenIterableLike[Param[N, E], DefaultGraphImpl[N, E]]

Inherited from Traversable[Param[N, E]]

Inherited from GenTraversable[Param[N, E]]

Inherited from GenericTraversableTemplate[Param[N, E], Set]

Inherited from TraversableLike[Param[N, E], DefaultGraphImpl[N, E]]

Inherited from GenTraversableLike[Param[N, E], DefaultGraphImpl[N, E]]

Inherited from Parallelizable[Param[N, E], ParSet[Param[N, E]]]

Inherited from TraversableOnce[Param[N, E]]

Inherited from GenTraversableOnce[Param[N, E]]

Inherited from FilterMonadic[Param[N, E], DefaultGraphImpl[N, E]]

Inherited from HasNewBuilder[Param[N, E], DefaultGraphImpl[N, E]]

Inherited from (Param[N, E]) ⇒ Boolean

Inherited from AnyRef

Inherited from Any

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

Inherited by implicit conversion CollectionsHaveToParArray from DefaultGraphImpl[N, E] to CollectionsHaveToParArray[DefaultGraphImpl[N, E], T]

Inherited by implicit conversion MonadOps from DefaultGraphImpl[N, E] to MonadOps[Param[N, E]]

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

Inherited by implicit conversion predicateToNodePredicate from DefaultGraphImpl[N, E] to (Param[Param[N, E], EI]) ⇒ Boolean

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

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

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

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

Inherited by implicit conversion alternateImplicit from DefaultGraphImpl[N, E] to ForceImplicitAmbiguity

Ungrouped