Trait

scalax.collection.constrained.mutable

AdjacencyListGraph

Related Doc: package mutable

Permalink

trait AdjacencyListGraph[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: AdjacencyListGraph[X, Y[X], This] with Graph[X, Y[X]]] extends GraphLike[N, E, This] with mutable.AdjacencyListGraph[N, E, This]

Implements an adjacency list based graph representation.

An adjacency list based representation speeds up traversing a graph along its paths by storing the list of connecting edges to each node.

Self Type
This[N, E]
Linear Supertypes
mutable.AdjacencyListGraph[N, E, This], AdjacencyListBase[N, E, This], GraphLike[N, E, This], constrained.GraphLike[N, E, This], Constrained[N, E], ConstraintHandlerMethods[N, E], ConstraintMethods[N, E], mutable.GraphLike[N, E, This], Mutable, EdgeOps[N, E, This], Cloneable[Graph[N, E]], Cloneable, Cloneable, Shrinkable[Param[N, E]], Growable[Param[N, E]], Clearable, collection.GraphLike[N, E, This], GraphDegree[N, E], GraphTraversal[N, E], GraphBase[N, E], Serializable, Serializable, SetLike[Param[N, E], This[N, E]], Subtractable[Param[N, E], This[N, E]], GenSetLike[Param[N, E], This[N, E]], (Param[N, E]) ⇒ Boolean, IterableLike[Param[N, E], This[N, E]], GenIterableLike[Param[N, E], This[N, E]], TraversableLike[Param[N, E], This[N, E]], GenTraversableLike[Param[N, E], This[N, E]], Parallelizable[Param[N, E], ParSet[Param[N, E]]], TraversableOnce[Param[N, E]], GenTraversableOnce[Param[N, E]], FilterMonadic[Param[N, E], This[N, E]], HasNewBuilder[Param[N, E], This[N, E]], Equals, AnyRef, Any
Known Subclasses
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. AdjacencyListGraph
  2. AdjacencyListGraph
  3. AdjacencyListBase
  4. GraphLike
  5. GraphLike
  6. Constrained
  7. ConstraintHandlerMethods
  8. ConstraintMethods
  9. GraphLike
  10. Mutable
  11. EdgeOps
  12. Cloneable
  13. Cloneable
  14. Cloneable
  15. Shrinkable
  16. Growable
  17. Clearable
  18. GraphLike
  19. GraphDegree
  20. GraphTraversal
  21. GraphBase
  22. Serializable
  23. Serializable
  24. SetLike
  25. Subtractable
  26. GenSetLike
  27. Function1
  28. IterableLike
  29. GenIterableLike
  30. TraversableLike
  31. GenTraversableLike
  32. Parallelizable
  33. TraversableOnce
  34. GenTraversableOnce
  35. FilterMonadic
  36. HasNewBuilder
  37. Equals
  38. AnyRef
  39. Any
Implicitly
  1. by anyToNode
  2. by MonadOps
  3. by CollectionsHaveToParArray
  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

Type Members

  1. sealed abstract class AbstractTopologicalOrder[+A, +T] extends AbstractTraversable[T]

    Permalink
    Definition Classes
    GraphTraversal
  2. abstract class Component extends Properties

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  3. abstract class ComponentTraverser extends FluentProperties[ComponentTraverser] with Properties with Traversable[Component]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  4. abstract type Config <: GraphConfig with GenConstrainedConfig with AdjacencyListArrayConfig

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike
  5. trait Cycle extends Path

    Permalink
    Definition Classes
    GraphTraversal
  6. type CycleNodeOrTopologicalOrder = Either[This.NodeT, This.TopologicalOrder[This.NodeT]]

    Permalink
    Definition Classes
    GraphTraversal
  7. trait DegreeFunction extends ((GraphDegree.this)#NodeT) ⇒ Int

    Permalink
    Definition Classes
    GraphDegree
  8. type DegreeNodeSeqEntry = (Int, This.NodeT)

    Permalink
    Definition Classes
    GraphDegree
  9. final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]

    Permalink
    Definition Classes
    GraphDegree
  10. trait Edge extends Serializable

    Permalink
    Definition Classes
    GraphBase
  11. class EdgeBase extends InnerEdgeParam[N, E, GraphBase.NodeT, E] with InnerEdge

    Permalink
    Definition Classes
    GraphBase
  12. type EdgeFilter = (This.EdgeT) ⇒ Boolean

    Permalink
    Definition Classes
    GraphBase
  13. class EdgeImpl extends mutable.AdjacencyListGraph.This.EdgeBase

    Permalink
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()
  14. sealed trait EdgeOrdering extends Ordering[GraphBase.EdgeT] with ElemOrdering

    Permalink
    Definition Classes
    GraphBase
  15. class EdgeSet extends This.EdgeSet

    Permalink
    Annotations
    @SerialVersionUID()
  16. type EdgeSetT = This.EdgeSet

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
  17. type EdgeT = This.EdgeImpl

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphBase
  18. sealed trait ElemOrdering extends AnyRef

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase
  19. trait ExtendedNodeVisitor[U] extends (GraphTraversal.NodeT) ⇒ U with (GraphTraversal.NodeT, Int, Int, ⇒ NodeInformer) ⇒ U

    Permalink
    Definition Classes
    GraphTraversal
  20. trait Filter[T] extends (T) ⇒ Boolean

    Permalink
    Definition Classes
    GraphDegree
  21. abstract class FluentProperties[+This <: FluentProperties[This]] extends AnyRef

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  22. trait InnerEdge extends Iterable[GraphBase.NodeT] with InnerEdgeParam[N, E, GraphBase.NodeT, E] with Edge with InnerElem

    Permalink
    Definition Classes
    GraphBase
  23. abstract class InnerEdgeTraverser extends TraverserMethods[GraphTraversal.EdgeT, InnerEdgeTraverser] with Traverser[GraphTraversal.EdgeT, InnerEdgeTraverser]

    Permalink
    Definition Classes
    GraphTraversal
  24. sealed trait InnerElem extends AnyRef

    Permalink
    Definition Classes
    GraphBase
  25. abstract class InnerElemTraverser extends TraverserMethods[GraphTraversal.InnerElem, InnerElemTraverser] with Traverser[GraphTraversal.InnerElem, InnerElemTraverser]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  26. trait InnerNode extends (AdjacencyListBase.this)#InnerNode

    Permalink
    Definition Classes
    AdjacencyListBase
  27. abstract class InnerNodeDownUpTraverser extends TraverserMethods[(Boolean, GraphTraversal.NodeT), InnerNodeDownUpTraverser] with Traverser[(Boolean, GraphTraversal.NodeT), InnerNodeDownUpTraverser]

    Permalink
    Definition Classes
    GraphTraversal
  28. abstract class InnerNodeImpl extends mutable.AdjacencyListGraph.This.NodeBase with mutable.AdjacencyListGraph.This.InnerNode with mutable.AdjacencyListGraph.This.InnerNode

    Permalink
    Definition Classes
    AdjacencyListGraph
  29. trait InnerNodeOps extends AnyRef

    Permalink
    Definition Classes
    EdgeOps
  30. abstract class InnerNodeTraverser extends TraverserMethods[GraphTraversal.NodeT, InnerNodeTraverser] with Traverser[GraphTraversal.NodeT, InnerNodeTraverser]

    Permalink
    Definition Classes
    GraphTraversal
  31. case class Layer extends Product with Serializable

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

    Permalink
    Definition Classes
    GraphTraversal
  33. type Layers = Traversable[This.Layer]

    Permalink
    Definition Classes
    GraphTraversal
  34. trait Node extends Serializable

    Permalink
    Definition Classes
    GraphBase
  35. abstract class NodeBase extends GraphLike.This.NodeBase with InnerNodeParam[N] with GraphLike.This.InnerNode

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  36. type NodeFilter = (This.NodeT) ⇒ Boolean

    Permalink
    Definition Classes
    GraphBase
  37. sealed trait NodeOrdering extends Ordering[GraphBase.NodeT] with ElemOrdering

    Permalink
    Definition Classes
    GraphBase
  38. class NodeSet extends This.NodeSet

    Permalink
    Annotations
    @SerialVersionUID()
  39. type NodeSetT = This.NodeSet

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
  40. abstract type NodeT <: This.InnerNodeImpl

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphTraversal → GraphBase
  41. abstract class OuterEdgeTraverser extends TraverserMethods[E[N], OuterEdgeTraverser] with Traverser[E[N], OuterEdgeTraverser]

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
  45. trait Path extends Walk

    Permalink
    Definition Classes
    GraphTraversal
  46. trait PathBuilder extends WalkBuilder with Builder[GraphTraversal.InnerElem, Path]

    Permalink
    Definition Classes
    GraphTraversal
  47. trait Properties extends SubgraphProperties

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  48. type Self = This[N, E]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  49. trait SubgraphProperties extends AnyRef

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  50. type ThisGraph = AdjacencyListGraph.this.type

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  51. final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]

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

    Permalink
    Definition Classes
    GraphTraversal
  53. trait TraverserInnerNode extends GraphTraversal.InnerNode

    Permalink
    Definition Classes
    GraphTraversal
  54. abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]

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

    Permalink
    Definition Classes
    GraphTraversal
  56. trait WalkBuilder extends Builder[GraphTraversal.InnerElem, Walk]

    Permalink
    Definition Classes
    GraphTraversal
  57. class Weight extends AnyRef

    Permalink
    Definition Classes
    GraphTraversal
  58. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def componentTraverser(parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.ComponentTraverser

    Permalink
    Definition Classes
    GraphTraversal
  2. implicit abstract def config: generic.GraphConstrainedCompanion.Config with This.Config

    Permalink
    Definition Classes
    GraphLike
  3. abstract val constraintFactory: ConstraintCompanion[Constraint]

    Permalink
    Definition Classes
    GraphLike
  4. implicit abstract val edgeT: ClassTag[E[N]]

    Permalink
    Definition Classes
    GraphLike
  5. abstract def edges: This.EdgeSetT

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphBase
  6. abstract def empty: This[N, E]

    Permalink
    Definition Classes
    SetLike
  7. abstract val graphCompanion: GraphConstrainedCompanion[This]

    Permalink
    Definition Classes
    GraphLike → GraphLike
  8. abstract def innerEdgeTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.InnerEdgeTraverser

    Permalink
    Definition Classes
    GraphTraversal
  9. abstract def innerElemTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.InnerElemTraverser

    Permalink
    Definition Classes
    GraphTraversal
  10. abstract def innerNodeDownUpTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.InnerNodeDownUpTraverser

    Permalink
    Definition Classes
    GraphTraversal
  11. abstract def innerNodeTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.InnerNodeTraverser

    Permalink
    Definition Classes
    GraphTraversal
  12. abstract def newNodeSet: This.NodeSetT

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  13. abstract def newNodeWithHints(node: N, hints: Hints): This.NodeT

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  14. abstract def newPathBuilder(start: This.NodeT)(implicit sizeHint: Int, edgeSelector: (This.NodeT, This.NodeT) ⇒ Option[This.EdgeT]): This.PathBuilder

    Permalink
    Definition Classes
    GraphTraversal
  15. abstract def newWalkBuilder(start: This.NodeT)(implicit sizeHint: Int, edgeSelector: (This.NodeT, This.NodeT) ⇒ Option[This.EdgeT]): This.WalkBuilder

    Permalink
    Definition Classes
    GraphTraversal
  16. abstract def nodes: This.NodeSetT

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphBase
  17. abstract def outerEdgeTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.OuterEdgeTraverser

    Permalink
    Definition Classes
    GraphTraversal
  18. abstract def outerElemTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.OuterElemTraverser

    Permalink
    Definition Classes
    GraphTraversal
  19. abstract def outerNodeDownUpTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.OuterNodeDownUpTraverser

    Permalink
    Definition Classes
    GraphTraversal
  20. abstract def outerNodeTraverser(root: This.NodeT, parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.OuterNodeTraverser

    Permalink
    Definition Classes
    GraphTraversal
  21. abstract def preAdd(edge: E[N]): PreCheckResult

    Permalink

    This pre-check must return Abort if the addition is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the outer edge is allowed to be added.

    This pre-check must return Abort if the addition is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the outer edge is allowed to be added. If postAdd has been implemented, this method may always return PostCheck. This pre-check may be omitted by letting it always return postCheck and overriding the corresponding post-check commit* method. Use self to access the associated graph.

    edge

    to be added.

    returns

    The results of the pre-check containing the follow-up activity and possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  22. abstract def preAdd(node: N): PreCheckResult

    Permalink

    This pre-check must return Abort if the addition is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the outer node is allowed to be added.

    This pre-check must return Abort if the addition is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the outer node is allowed to be added. If postAdd has been implemented, this method may always return PostCheck. This pre-check may be omitted by letting it always return postCheck and overriding the corresponding post-check commit* method. Use self to access the associated graph.

    node

    to be added

    returns

    The results of the pre-check containing the follow-up activity and possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  23. abstract def preSubtract(edge: Graph.EdgeT, simple: Boolean): PreCheckResult

    Permalink

    This pre-check must return Abort if the subtraction of edge is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if the the edge is allowed to be subtracted.

    This pre-check must return Abort if the subtraction of edge is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if the the edge is allowed to be subtracted. This pre-check may be omitted by letting it always return postCheck and overriding the corresponding post-check commit* method. Use self to access the associated graph.

    edge

    the inner edge to be subtracted.

    simple

    true for standard (edge-only by -), false for ripple (by -!) removal.

    returns

    The results of the pre-check containing the follow-up activity and possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  24. abstract def preSubtract(node: Graph.NodeT, forced: Boolean): PreCheckResult

    Permalink

    This pre-check must return Abort if the subtraction of node is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if the the node is allowed to be subtracted.

    This pre-check must return Abort if the subtraction of node is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if the the node is allowed to be subtracted. This pre-check may be omitted by letting it always return postCheck and overriding the corresponding post-check commit* method. Use self to access the associated graph.

    node

    the inner to be subtracted.

    forced

    true for standard (ripple by -), false for gentle (by -?) removal.

    returns

    The results of the pre-check containing the follow-up activity and possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  25. abstract val self: constrained.Graph[N, E]

    Permalink

    When extending Constraint, self will denote the attached constrained graph.

    When extending Constraint, self will denote the attached constrained graph. The factory methods of the companion object scalax.collection.constrained.Graph initialize self to the correct graph instance. When extending Constrained, self will denote this graph.

    Definition Classes
    ConstraintMethods
  26. abstract def seq: Set[Param[N, E]]

    Permalink
    Definition Classes
    GenSetLike → Parallelizable → GenTraversableOnce

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[Param[N, E]]): This[N, E]

    Permalink
    Definition Classes
    GenSetLike
  4. def &=(coll: Iterable[Param[N, E]]): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    GraphLike
  5. def &~(that: GenSet[Param[N, E]]): This[N, E]

    Permalink
    Definition Classes
    GenSetLike
  6. def +(node: N): This[N, E]

    Permalink
    Definition Classes
    GraphLike → GraphLike → GraphLike
  7. def +(elem: Param[N, E]): This[N, E]

    Permalink
    Definition Classes
    GraphLike → SetLike → GenSetLike
  8. def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): This[N, E]

    Permalink
    Definition Classes
    SetLike
  9. final def +#(edge: E[N]): This[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  10. def ++(elems: GenTraversableOnce[Param[N, E]]): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    GraphLike → GraphLike → SetLike
  11. def ++[B >: Param[N, E], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  12. def ++:[B >: Param[N, E], That](that: Traversable[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  13. def ++:[B >: Param[N, E], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  14. def ++=(elems: TraversableOnce[Param[N, E]]): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    GraphLike → GraphLike → Growable
  15. def +=(elem: Param[N, E]): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    GraphLike → Growable
  16. final def +=(node: N): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  17. def +=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    Growable
  18. final def +=#(edge: E[N]): AdjacencyListGraph.this.type

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  19. final def +~%+=[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(weight: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  20. final def +~%+=[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: N, node_2: N)(weight: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  21. final def +~%=[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: N, node_2: N, nodes: N*)(weight: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  22. final def +~%=[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: N, node_2: N)(weight: Long)(implicit edgeFactory: WEdgeCompanion[EE]): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  23. 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]): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  24. 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]): AdjacencyListGraph.this.type

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

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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  27. final def -(edge: E[N]): This[N, E]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  28. final def -(node: N): This[N, E]

    Permalink
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  29. def -(elem: Param[N, E]): This[N, E]

    Permalink
    Definition Classes
    GraphLike → SetLike → Subtractable → GenSetLike
  30. def -(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): This[N, E]

    Permalink
    Definition Classes
    Subtractable
  31. final def -!(edge: E[N]): This[N, E]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  32. def -!(elem: Param[N, E]): This[N, E]

    Permalink
    Definition Classes
    GraphLike
  33. final def -!#(edge: E[N]): This[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  34. def -!=(elem: Param[N, E]): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    GraphLike
  35. final def -!=#(edge: E[N]): AdjacencyListGraph.this.type

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  36. final def -#(edge: E[N]): This[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  37. def --(elems: GenTraversableOnce[Param[N, E]]): This[N, E]

    Permalink
    Definition Classes
    GraphLike → GraphLike → Subtractable
  38. def --!(elems: GenTraversableOnce[Param[N, E]]): This[N, E]

    Permalink
    Definition Classes
    GraphLike
  39. final def --!=(coll: Iterable[Param[N, E]]): This[N, E]

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  40. def --=(elems: TraversableOnce[Param[N, E]]): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    GraphLike → Shrinkable
  41. def -=(elem: Param[N, E]): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    GraphLike → Shrinkable
  42. final def -=(node: N): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  43. def -=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    Shrinkable
  44. final def -=#(edge: E[N]): AdjacencyListGraph.this.type

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  45. def ->[B](y: B): (AdjacencyListGraph[N, E, This], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to ArrowAssoc[AdjacencyListGraph[N, E, This]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  46. final def -?(node: N): This[N, E]

    Permalink
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  47. final def -?=(node: N): AdjacencyListGraph.this.type

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  48. def /:[B](z: B)(op: (B, Param[N, E]) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  49. def :\[B](z: B)(op: (Param[N, E], B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  51. object Edge extends Serializable

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @transient()
  52. object InnerEdge extends Serializable

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @transient()
  53. object InnerNode extends Serializable

    Permalink
    Definition Classes
    GraphBase
  54. object Node extends Serializable

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @transient()
  55. object TraverserInnerNode extends Serializable

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @transient()
  56. final def add(edge: E[N]): Boolean

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  57. final def add(node: N): Boolean

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  58. final def addAndGet(edge: E[N]): This.EdgeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  59. final def addAndGet(node: N): This.NodeT

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  60. def addAndGetEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind): This.EdgeT

    Permalink
    Definition Classes
    EdgeOps
  61. final def addAndGetEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): This.EdgeT

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  62. 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]): This.EdgeT

    Permalink
    Definition Classes
    EdgeOps
  63. 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]): This.EdgeT

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  64. def addAndGetWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: N, node_2: N, nodes: N*)(weight: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): This.EdgeT

    Permalink
    Definition Classes
    EdgeOps
  65. final def addAndGetWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](node_1: N, node_2: N)(weight: Long)(implicit edgeFactory: WEdgeCompanion[EE]): This.EdgeT

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  66. def addAndGetWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(weight: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): This.EdgeT

    Permalink
    Definition Classes
    EdgeOps
  67. final def addAndGetWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](node_1: N, node_2: N)(weight: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): This.EdgeT

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

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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  70. 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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  71. 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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  72. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  73. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  74. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  75. final def addWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](node_1: N, node_2: N, nodes: N*)(weight: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Boolean

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

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

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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  79. def aggregate[B](z: ⇒ B)(seqop: (B, Param[N, E]) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  80. def allNodes(innerNodes: Set[Graph.NodeT], innerEdges: Set[Graph.EdgeT]): Set[Graph.NodeT]

    Permalink

    Consolidates all inner nodes of the arguments by adding the edge ends of passedEdges to passedNodes.

    Consolidates all inner nodes of the arguments by adding the edge ends of passedEdges to passedNodes.

    Attributes
    protected
    Definition Classes
    ConstraintMethods
  81. def allNodes(passedNodes: Traversable[N], passedEdges: Traversable[E[N]]): Set[N]

    Permalink

    Consolidates all outer nodes of the arguments by adding the edge ends of passedEdges to passedNodes.

    Consolidates all outer nodes of the arguments by adding the edge ends of passedEdges to passedNodes.

    Attributes
    protected
    Definition Classes
    ConstraintMethods
  82. def andThen[A](g: (Boolean) ⇒ A): (Param[N, E]) ⇒ A

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  83. final val anyEdge: This.EdgeFilter

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

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  85. final val anyNode: This.NodeFilter

    Permalink
    Definition Classes
    GraphBase
  86. final lazy val anyOrdering: AnyOrdering[N]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase
  87. def apply(elem: Param[N, E]): Boolean

    Permalink
    Definition Classes
    GenSetLike → Function1
  88. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  89. def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: This.NodeOrdering, ordEdge: This.EdgeOrdering): String

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  91. def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    IterableLike → Equals
  92. var checkSuspended: Boolean

    Permalink

    This flag is used to prevent constraint checking for single additions and subtractions triggered by a multiple addition/subtraction such as ++=.

    This flag is used to prevent constraint checking for single additions and subtractions triggered by a multiple addition/subtraction such as ++=.

    Attributes
    protected
    Definition Classes
    GraphLike
  93. def checkedAdd[G >: This[N, E]](contained: ⇒ Boolean, preAdd: ⇒ PreCheckResult, copy: ⇒ G, nodes: ⇒ Traversable[N], edges: ⇒ Traversable[E[N]]): This[N, E]

    Permalink

    generic checked addition

    generic checked addition

    Attributes
    protected
    Definition Classes
    GraphLike
  94. final def clear(): Unit

    Permalink
    Definition Classes
    AdjacencyListGraph → Growable → Clearable
    Annotations
    @inline()
  95. def clone(): This[N, E]

    Permalink
    Definition Classes
    GraphLike → Cloneable → AnyRef
  96. def collect[B, That](pf: PartialFunction[Param[N, E], B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  97. def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  98. def compose[A](g: (A) ⇒ Param[N, E]): (A) ⇒ Boolean

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  99. def contains(elem: Param[N, E]): Boolean

    Permalink
    Definition Classes
    GraphLike → SetLike → GenSetLike
  100. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  101. def copyToArray[B >: Param[N, E]](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce
  104. def count(p: (Param[N, E]) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. final lazy val defaultEdgeOrdering: This.EdgeOrdering

    Permalink
    Definition Classes
    GraphBase
  106. final lazy val defaultNodeOrdering: This.NodeOrdering

    Permalink
    Definition Classes
    GraphBase
  107. final def defaultPathSize: Int

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  108. def degreeCount(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, Int]

    Permalink
    Definition Classes
    GraphDegree
  109. def degreeNodeSeq(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[This.DegreeNodeSeqEntry]

    Permalink
    Definition Classes
    GraphDegree
  110. def degreeNodesMap(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, AnySet[This.NodeT]]

    Permalink
    Definition Classes
    GraphDegree
  111. def degreeSeq(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[Int]

    Permalink
    Definition Classes
    GraphDegree
  112. def degreeSet(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedSet[Int]

    Permalink
    Definition Classes
    GraphDegree
  113. def diff(that: GenSet[Param[N, E]]): This[N, E]

    Permalink
    Definition Classes
    SetLike → GenSetLike
  114. def drop(n: Int): This[N, E]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  115. def dropRight(n: Int): This[N, E]

    Permalink
    Definition Classes
    IterableLike
  116. def dropWhile(p: (Param[N, E]) ⇒ Boolean): This[N, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  117. def edgeIterator: GroupIterator[This.EdgeT] { ... /* 2 definitions in type refinement */ }

    Permalink
    Definition Classes
    AdjacencyListBase
  118. implicit final def edgeToEdgeCont(e: E[N]): E[This.NodeT]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase
    Annotations
    @inline()
  119. def ensuring(cond: (AdjacencyListGraph[N, E, This]) ⇒ Boolean, msg: ⇒ Any): AdjacencyListGraph[N, E, This]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to Ensuring[AdjacencyListGraph[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  120. def ensuring(cond: (AdjacencyListGraph[N, E, This]) ⇒ Boolean): AdjacencyListGraph[N, E, This]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to Ensuring[AdjacencyListGraph[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  121. def ensuring(cond: Boolean, msg: ⇒ Any): AdjacencyListGraph[N, E, This]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to Ensuring[AdjacencyListGraph[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  122. def ensuring(cond: Boolean): AdjacencyListGraph[N, E, This]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to Ensuring[AdjacencyListGraph[N, E, This]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  123. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  124. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    GraphLike → GenSetLike → Equals → AnyRef → Any
  125. def exists(p: (Param[N, E]) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  126. def filter(p: (Param[N, E]) ⇒ Boolean): This[N, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  127. def filterNot(p: (Param[N, E]) ⇒ Boolean): This[N, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  128. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  129. final def find(outerEdge: E[N]): Option[This.EdgeT]

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

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  131. def find(p: (Param[N, E]) ⇒ Boolean): Option[Param[N, E]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  132. final def findCycle[U](implicit visitor: (This.InnerElem) ⇒ U): Option[This.Cycle]

    Permalink
    Definition Classes
    GraphTraversal
  133. def flatMap[B, That](f: (Param[N, E]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  134. def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def foldLeft[B](z: B)(op: (B, Param[N, E]) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def foldRight[B](z: B)(op: (Param[N, E], B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  137. def forall(p: (Param[N, E]) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  138. def foreach[U](f: (Param[N, E]) ⇒ U): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  139. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to StringFormat[AdjacencyListGraph[N, E, This]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  140. final def get(outerEdge: E[N]): This.EdgeT

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

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  142. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  143. final def getOrElse(outerEdge: E[N], default: This.EdgeT): This.EdgeT

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

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  145. def graphSize: Int

    Permalink
    Definition Classes
    GraphBase
  146. def groupBy[K](f: (Param[N, E]) ⇒ K): Map[K, This[N, E]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  147. def grouped(size: Int): Iterator[This[N, E]]

    Permalink
    Definition Classes
    IterableLike
  148. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  149. def hashCode(): Int

    Permalink
    Definition Classes
    GenSetLike → AnyRef → Any
  150. def having(node: This.NodeFilter, edge: This.EdgeFilter): PartialFunction[Param[N, E], Boolean]

    Permalink
    Definition Classes
    GraphLike
  151. def head: Param[N, E]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  152. def headOption: Option[Param[N, E]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  153. def init: This[N, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  154. def initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
  155. def initializeFrom(in: ObjectInputStream, nodes: This.NodeSetT, edges: This.EdgeSetT): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  156. def inits: Iterator[This[N, E]]

    Permalink
    Definition Classes
    TraversableLike
  157. def intersect(that: GenSet[Param[N, E]]): This[N, E]

    Permalink
    Definition Classes
    GenSetLike
  158. final def isAcyclic: Boolean

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

    Permalink
    Definition Classes
    GraphTraversal
  160. def isConnected: Boolean

    Permalink
    Definition Classes
    GraphTraversal
  161. final def isCustomEdgeFilter(f: This.EdgeFilter): Boolean

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

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

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  164. def isDefined: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to OuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  165. def isDirected: Boolean

    Permalink
    Definition Classes
    GraphLike → GraphBase
  166. final val isDirectedT: Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  167. def isEdge: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to OuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  168. def isEmpty: Boolean

    Permalink
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  169. def isHyper: Boolean

    Permalink
    Definition Classes
    GraphLike → GraphBase
  170. final val isHyperT: Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  171. def isIn: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to OuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  172. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  173. def isMulti: Boolean

    Permalink
    Definition Classes
    GraphLike → GraphBase
  174. final val isMultiT: Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  175. def isNode: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to OuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  176. def isOut: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to OuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  177. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  178. final def isTrivial: Boolean

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @inline()
  179. def iterator: Iterator[OutParam[N, E] with Serializable with This.InnerElem]

    Permalink
    Definition Classes
    GraphLike → GenSetLike → IterableLike → GenIterableLike
  180. def last: Param[N, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  181. def lastOption: Option[Param[N, E]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  182. def map[B, That](f: (Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[This[N, E], B, That]): That

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

  183. def max[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  184. def maxBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  185. def maxDegree(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GraphDegree
  186. def min[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  187. def minBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  188. def minDegree(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GraphDegree
  189. def minusMinus(delNodes: Traversable[N], delEdges: Traversable[E[N]]): This[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  190. def minusMinusNodesEdges(delNodes: Traversable[N], delEdges: Traversable[E[N]]): (Set[N], Set[E[N]])

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  191. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  192. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  193. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  194. val n1: AdjacencyListGraph[N, E, This]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to EdgeAssoc[AdjacencyListGraph[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  195. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  196. def newBuilder: Builder[Param[N, E], This[N, E]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  197. final def newEdge(innerEdge: E[This.NodeT]): This.EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  198. final def newEdgeTArray(size: Int): Array[This.EdgeT]

    Permalink
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase
    Annotations
    @inline()
  199. final def newNode(n: N): This.NodeT

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListBase → GraphBase
    Annotations
    @inline()
  200. final val noNode: This.NodeFilter

    Permalink
    Definition Classes
    GraphBase
  201. 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[This.NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  202. def nodesToCEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with CEdgeBound[_, EE]](factory: CEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N): E[This.NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  203. final def nodesToEdge(edgeFactory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit endpointsKind: CollectionKind): This.EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  204. final def nodesToEdge(edgeFactory: EdgeCompanion[E], node_1: N, node_2: N): This.EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  205. def nodesToEdgeCont(factory: EdgeCompanion[E], node_1: N, node_2: N): E[This.NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  206. def nodesToEdgeCont(factory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[This.NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  207. 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*): This.EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  208. 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): This.EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  209. 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[This.NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  210. 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): E[This.NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  211. final def nodesToWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](edgeFactory: WHyperEdgeCompanion[EE], weight: Long, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): This.EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  212. final def nodesToWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](edgeFactory: WEdgeCompanion[EE], weight: Long, node_1: N, node_2: N): This.EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  213. def nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](factory: WEdgeCompanion[EE], weight: Long, node_1: N, node_2: N): E[This.NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  214. def nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](factory: WHyperEdgeCompanion[EE], weight: Long, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[This.NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  215. final def nodesToWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](edgeFactory: WLHyperEdgeCompanion[EE], weight: Long, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): This.EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  216. final def nodesToWLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](edgeFactory: WLEdgeCompanion[EE], weight: Long, label: L, node_1: N, node_2: N): This.EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  217. def nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](factory: WLEdgeCompanion[EE], weight: Long, label: L, node_1: N, node_2: N): E[This.NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  218. def nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](factory: WLHyperEdgeCompanion[EE], weight: Long, label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[This.NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  219. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  220. final def nonTrivial: Boolean

    Permalink
    Definition Classes
    GraphBase
    Annotations
    @inline()
  221. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  222. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  223. def onAdditionRefused(refusedNodes: Traversable[N], refusedEdges: Traversable[E[N]], graph: constrained.Graph[N, E]): Boolean

    Permalink

    This handler is called whenever an addition violates the constraints.

    This handler is called whenever an addition violates the constraints. The provided default implementation is empty.

    refusedNodes

    the nodes passed to preAdd.

    refusedEdges

    the edges passed to preAdd.

    returns

    must be true if the handler has been overridden but it doesn't throw an exception.

    Definition Classes
    ConstraintHandlerMethods
  224. def onSubtractionRefused(refusedNodes: Traversable[Graph.NodeT], refusedEdges: Traversable[Graph.EdgeT], graph: constrained.Graph[N, E]): Boolean

    Permalink

    This handler is called whenever a subtraction violates the constraints.

    This handler is called whenever a subtraction violates the constraints. The provided default implementation is empty.

    refusedNodes

    the nodes passed to preSubtract.

    refusedEdges

    the edges passed to preSubtract.

    returns

    must be true if the handler has been overridden but it doesn't throw an exception.

    Definition Classes
    ConstraintHandlerMethods
  225. def order: Int

    Permalink
    Definition Classes
    GraphBase
  226. def par: ParSet[Param[N, E]]

    Permalink
    Definition Classes
    Parallelizable
  227. def parCombiner: Combiner[Param[N, E], ParSet[Param[N, E]]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  228. final def partition(elems: GenTraversableOnce[Param[N, E]]): Partitions[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  229. def partition(p: (Param[N, E]) ⇒ Boolean): (This[N, E], This[N, E])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  230. def plusPlus(newNodes: Traversable[N], newEdges: Traversable[E[N]]): This[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  231. def postAdd(newGraph: constrained.Graph[N, E], passedNodes: Traversable[N], passedEdges: Traversable[E[N]], preCheck: PreCheckResult): Boolean

    Permalink

    This post-check must return whether newGraph should be committed or the add operation is to be rolled back.

    This post-check must return whether newGraph should be committed or the add operation is to be rolled back. Use self to access the associated graph. For immutable graphs, self maintains the state before the addition but for mutable graphs, it is already mutated to the required state.

    newGraph

    the after-addition would-be graph waiting for commit.

    passedNodes

    nodes passed to the running add operation except those coming from node/edge input streams.

    passedEdges

    edges passed to the running add operation except those coming from edge input streams.

    Definition Classes
    ConstraintMethods
  232. def postSubtract(newGraph: constrained.Graph[N, E], passedNodes: Traversable[N], passedEdges: Traversable[E[N]], preCheck: PreCheckResult): Boolean

    Permalink

    This post-check must return whether newGraph should be committed or the subtraction is to be rolled back.

    This post-check must return whether newGraph should be committed or the subtraction is to be rolled back. Use self to access the associated graph. For immutable graphs, self maintains the state before the addition but for mutable graphs, it is already mutated to the required state.

    newGraph

    the after-subtraction would-be graph waiting for commit.

    Definition Classes
    ConstraintMethods
  233. def preAdd(elems: InParam[N, E]*): PreCheckResult

    Permalink

    This pre-check must return Abort if the addition of the outer nodes and/or edges in elems is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the the outer nodes and/or edges are allowed to be added.

    This pre-check must return Abort if the addition of the outer nodes and/or edges in elems is to be canceled, PostCheck if postAdd is to be called to decide or Complete if the the outer nodes and/or edges are allowed to be added. If postAdd has been implemented, this method may always return PostCheck. The default implementation calls preAdd(node)/preAdd(edge) element-wise. As for most cases this won't be satisfactory a domain-specific implementation should be provided. Use self to access the associated graph.

    elems

    nodes and/or edges to be added possibly containing duplicates.

    returns

    The results of the pre-check containing the follow-up activity and possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  234. def preCreate(nodes: Traversable[N], edges: Traversable[E[N]]): PreCheckResult

    Permalink

    This pre-check is called on constructing a graph through its companion object.

    This pre-check is called on constructing a graph through its companion object. It must return whether the graph is allowed to be populated with nodes and edges. The default implementation calls preAdd for each node and edge.

    Note that nodes and edges coming from node/edge input streams are not checked. So when utilizing streams the post check postAdd must be served.

    nodes

    the outer nodes the graph is to be populated with; nodes being edge ends may but need not be contained in nodes.

    edges

    the outer edges the graph is to be populated with.

    returns

    The results of the pre-check containing the follow-up activity and possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  235. def preSubtract(nodes: ⇒ Set[Graph.NodeT], edges: ⇒ Set[Graph.EdgeT], simple: Boolean): PreCheckResult

    Permalink

    This pre-check must return Abort if the subtraction of nodes and/or edges is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if nodes and/or edges are allowed to be subtracted.

    This pre-check must return Abort if the subtraction of nodes and/or edges is to be canceled, PostCheck if postSubtract is to be called to decide or Complete if nodes and/or edges are allowed to be subtracted. It is typically triggered by the -- operation. The default implementation element-wise calls preSubtract(node, simple) or preSubtract(edge, simple), respectively. As for most cases this won't be satisfactory a domain-specific implementation should be provided. Use self to access the associated graph.

    nodes

    the inner nodes to be subtracted not necessarily including the ends of edges to be subtracted. Call allNodes to get the complete set of nodes to be subtracted.

    edges

    the inner edges to be subtracted.

    simple

    true for standard (edge-only by -), false for ripple (by -!) removal.

    returns

    The results of the pre-check containing the follow-up activity and possible any intermediate computation results to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  236. def product[B >: Param[N, E]](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  237. def reduce[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  238. def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce
  239. def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  240. def reduceOption[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  241. def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  242. def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  243. final def remove(edge: E[N]): Boolean

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  244. final def remove(node: N): Boolean

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  245. final def removeGently(node: N): Boolean

    Permalink
    Definition Classes
    GraphLike
  246. final def removeWithNodes(edge: E[N]): Boolean

    Permalink
    Definition Classes
    GraphLike
    Annotations
    @inline()
  247. def repr: This[N, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  248. def reversed: List[Param[N, E]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  249. def sameElements[B >: Param[N, E]](that: GenIterable[B]): Boolean

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  250. def scan[B >: Param[N, E], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[This[N, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  251. def scanLeft[B, That](z: B)(op: (B, Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[This[N, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  252. def scanRight[B, That](z: B)(op: (Param[N, E], B) ⇒ B)(implicit bf: CanBuildFrom[This[N, E], B, That]): That

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

  253. final def serializeTo(out: ObjectOutputStream): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  254. def size: Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  255. def slice(from: Int, until: Int): This[N, E]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  256. def sliding(size: Int, step: Int): Iterator[This[N, E]]

    Permalink
    Definition Classes
    IterableLike
  257. def sliding(size: Int): Iterator[This[N, E]]

    Permalink
    Definition Classes
    IterableLike
  258. def span(p: (Param[N, E]) ⇒ Boolean): (This[N, E], This[N, E])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  259. def splitAt(n: Int): (This[N, E], This[N, E])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  260. def stringPrefix: String

    Permalink
    Definition Classes
    GraphLike → GraphLike → SetLike → TraversableLike → GenTraversableLike
  261. def subsetOf(that: GenSet[Param[N, E]]): Boolean

    Permalink
    Definition Classes
    GenSetLike
  262. def subsets(): Iterator[This[N, E]]

    Permalink
    Definition Classes
    SetLike
  263. def subsets(len: Int): Iterator[This[N, E]]

    Permalink
    Definition Classes
    SetLike
  264. def sum[B >: Param[N, E]](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  265. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  266. def tail: This[N, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  267. def tails: Iterator[This[N, E]]

    Permalink
    Definition Classes
    TraversableLike
  268. def take(n: Int): This[N, E]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  269. def takeRight(n: Int): This[N, E]

    Permalink
    Definition Classes
    IterableLike
  270. def takeWhile(p: (Param[N, E]) ⇒ Boolean): This[N, E]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  271. def thisCollection: Iterable[Param[N, E]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  272. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[N, E], Col[Param[N, E]]]): Col[Param[N, E]]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  273. def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  274. def toBuffer[A1 >: Param[N, E]]: Buffer[A1]

    Permalink
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  275. def toCollection(repr: This[N, E]): Iterable[Param[N, E]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  276. def toIndexedSeq: IndexedSeq[Param[N, E]]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  277. def toIterable: Iterable[Param[N, E]]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  278. def toIterator: Iterator[Param[N, E]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  279. def toList: List[Param[N, E]]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  280. def toMap[T, U](implicit ev: <:<[Param[N, E], (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  281. def toParArray: ParArray[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to CollectionsHaveToParArray[AdjacencyListGraph[N, E, This], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (AdjacencyListGraph[N, E, This]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  282. def toSeq: Seq[Param[N, E]]

    Permalink
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  283. def toSet[B >: Param[N, E]]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  284. def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: This.NodeOrdering, ordEdge: This.EdgeOrdering): String

    Permalink
    Definition Classes
    GraphLike
  285. def toStream: Stream[Param[N, E]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  286. def toString(): String

    Permalink
    Definition Classes
    GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any
  287. def toTraversable: Traversable[Param[N, E]]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  288. def toVector: Vector[Param[N, E]]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  289. final def topologicalSort[U](implicit visitor: (This.InnerElem) ⇒ U): This.CycleNodeOrTopologicalOrder

    Permalink
    Definition Classes
    GraphTraversal
  290. final def topologicalSortByComponent[U](implicit visitor: (This.InnerElem) ⇒ U): Traversable[This.CycleNodeOrTopologicalOrder]

    Permalink
    Definition Classes
    GraphTraversal
  291. def totalDegree(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GraphDegree
  292. def totalWeight: Long

    Permalink
    Definition Classes
    GraphBase
  293. def union(that: GenSet[Param[N, E]]): This[N, E]

    Permalink
    Definition Classes
    SetLike → GenSetLike
  294. final def upsert(edge: E[N]): Boolean

    Permalink
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  295. val value: AdjacencyListGraph[N, E, This]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to OuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  296. def view(from: Int, until: Int): IterableView[Param[N, E], This[N, E]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike
  297. def view: IterableView[Param[N, E], This[N, E]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike
  298. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  299. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  300. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  301. def withFilter(p: (Param[N, E]) ⇒ Boolean): FilterMonadic[Param[N, E], This[N, E]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic
  302. final def withoutChecks[R](exec: ⇒ R): R

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  303. def zip[A1 >: Param[N, E], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[This[N, E], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  304. def zipAll[B, A1 >: Param[N, E], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[This[N, E], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  305. def zipWithIndex[A1 >: Param[N, E], That](implicit bf: CanBuildFrom[This[N, E], (A1, Int), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  306. def |(that: GenSet[Param[N, E]]): This[N, E]

    Permalink
    Definition Classes
    GenSetLike
  307. def ~[N >: N1](n2: N): UnDiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to EdgeAssoc[AdjacencyListGraph[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  308. def ~>[N >: N1](n2: N): DiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to EdgeAssoc[AdjacencyListGraph[N, E, This]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  309. def [B](y: B): (AdjacencyListGraph[N, E, This], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to ArrowAssoc[AdjacencyListGraph[N, E, This]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to any2stringadd[AdjacencyListGraph[N, E, This]] performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: any2stringadd[AdjacencyListGraph[N, E, This]]).+(other)
    Definition Classes
    any2stringadd
  2. def andThen[A](g: (Boolean) ⇒ A): (Param[Param[N, E], EI]) ⇒ A

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: (Param[Param[N, E], EI]) ⇒ Boolean).andThen(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def apply(v1: Param[Param[N, E], EI]): Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: (Param[Param[N, E], EI]) ⇒ Boolean).apply(v1)
    Definition Classes
    Function1
  4. def compose[A](g: (A) ⇒ Param[Param[N, E], EI]): (A) ⇒ Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: (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]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] 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:
    (adjacencyListGraph: MonadOps[Param[N, E]]).filter(p)
    Definition Classes
    MonadOps
  6. def flatMap[B](f: (Param[N, E]) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] 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:
    (adjacencyListGraph: MonadOps[Param[N, E]]).flatMap(f)
    Definition Classes
    MonadOps
  7. def map[B](f: (Param[N, E]) ⇒ B): TraversableOnce[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] 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:
    (adjacencyListGraph: MonadOps[Param[N, E]]).map(f)
    Definition Classes
    MonadOps
  8. def stringPrefix: String

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to OuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: OuterNode[AdjacencyListGraph[N, E, This]]).stringPrefix
    Definition Classes
    NodeParam
  9. def toString(): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to OuterNode[AdjacencyListGraph[N, E, This]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: OuterNode[AdjacencyListGraph[N, E, This]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  10. def toString(): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] to (Param[Param[N, E], EI]) ⇒ Boolean performed by method predicateToNodePredicate in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (adjacencyListGraph: (Param[Param[N, E], EI]) ⇒ Boolean).toString()
    Definition Classes
    Function1 → AnyRef → Any
  11. def withFilter(p: (Param[N, E]) ⇒ Boolean): Iterator[Param[N, E]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from AdjacencyListGraph[N, E, This] 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:
    (adjacencyListGraph: MonadOps[Param[N, E]]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from mutable.AdjacencyListGraph[N, E, This]

Inherited from AdjacencyListBase[N, E, This]

Inherited from GraphLike[N, E, This]

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

Inherited from Constrained[N, E]

Inherited from ConstraintHandlerMethods[N, E]

Inherited from ConstraintMethods[N, E]

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

Inherited from Mutable

Inherited from EdgeOps[N, E, This]

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

Inherited from GraphDegree[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from Serializable

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

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

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

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

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

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

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

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

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

Inherited from Equals

Inherited from AnyRef

Inherited from Any

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

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

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

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

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

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

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

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

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

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

Ungrouped