Packages

  • package root
    Definition Classes
    root
  • package scalax
    Definition Classes
    root
  • package collection
    Definition Classes
    scalax
  • package constrained

    Traits enabling to implement constraints and use constrained graphs.

    Traits enabling to implement constraints and use constrained graphs.

    Graphs may be constrained dynamically or statically.

    Dynamically constrained means that a constraint is bound to a constrained Graph instance at initialization time. The constrained Graph will then delegate all calls to the methods of ConstraintMethods and ConstraintHandlerMethods to the corresponding methods of the constraint bound to it. The immutable and mutable factories Graph in this package yield dynamically constrained graphs.

    To make use of dynamically constrained graphs you may make use of the predefined constraints or provide an own implementation of Constraint along with its companion object. To initialize a graph with one or several combined constraints just call the graph factory methods of the constraint package passing.

    Statically constrained means that the graph class directly implements the methods declared in ConstraintMethods.

    Definition Classes
    collection
  • package mutable

    Mutable constrained graph templates.

    Mutable constrained graph templates.

    Definition Classes
    constrained
  • AdjacencyListGraph
  • CompanionAlias
  • DAG
  • DefaultGraphImpl
  • Forest
  • Graph
  • GraphBuilder
  • GraphLike
  • Tree
  • UserConstrainedGraphImpl

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
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]
    Definition Classes
    GraphTraversal
  2. abstract class Component extends Properties
    Definition Classes
    GraphTraversal
  3. abstract class ComponentTraverser extends FluentProperties[ComponentTraverser] with Properties with Traversable[Component]
    Definition Classes
    GraphTraversal
  4. abstract type Config <: GraphConfig with GenConstrainedConfig with AdjacencyListArrayConfig
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike
  5. trait Cycle extends Path
    Definition Classes
    GraphTraversal
  6. type CycleNodeOrTopologicalOrder = Either[This.NodeT, This.TopologicalOrder[This.NodeT]]
    Definition Classes
    GraphTraversal
  7. trait DegreeFunction extends ((GraphDegree.this)#NodeT) ⇒ Int
    Definition Classes
    GraphDegree
  8. type DegreeNodeSeqEntry = (Int, This.NodeT)
    Definition Classes
    GraphDegree
  9. final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]
    Definition Classes
    GraphDegree
  10. trait Edge extends Serializable
    Definition Classes
    GraphBase
  11. class EdgeBase extends InnerEdgeParam[N, E, GraphBase.NodeT, E] with InnerEdge
    Definition Classes
    GraphBase
  12. type EdgeFilter = (This.EdgeT) ⇒ Boolean
    Definition Classes
    GraphBase
  13. class EdgeImpl extends mutable.AdjacencyListGraph.This.EdgeBase
    Definition Classes
    AdjacencyListGraph
    Annotations
    @SerialVersionUID()
  14. sealed trait EdgeOrdering extends Ordering[GraphBase.EdgeT] with ElemOrdering
    Definition Classes
    GraphBase
  15. class EdgeSet extends This.EdgeSet
    Annotations
    @SerialVersionUID()
  16. type EdgeSetT = This.EdgeSet
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
  17. type EdgeT = This.EdgeImpl
    Definition Classes
    AdjacencyListGraph → GraphBase
  18. sealed trait ElemOrdering extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphBase
  19. trait ExtendedNodeVisitor[U] extends (GraphTraversal.NodeT) ⇒ U with (GraphTraversal.NodeT, Int, Int, ⇒ NodeInformer) ⇒ U
    Definition Classes
    GraphTraversal
  20. trait Filter[T] extends (T) ⇒ Boolean
    Definition Classes
    GraphDegree
  21. abstract class FluentProperties[+This <: FluentProperties[This]] extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphTraversal
  22. trait InnerEdge extends Iterable[GraphBase.NodeT] with InnerEdgeParam[N, E, GraphBase.NodeT, E] with Edge with InnerElem
    Definition Classes
    GraphBase
  23. abstract class InnerEdgeTraverser extends TraverserMethods[GraphTraversal.EdgeT, InnerEdgeTraverser] with Traverser[GraphTraversal.EdgeT, InnerEdgeTraverser]
    Definition Classes
    GraphTraversal
  24. sealed trait InnerElem extends AnyRef
    Definition Classes
    GraphBase
  25. abstract class InnerElemTraverser extends TraverserMethods[GraphTraversal.InnerElem, InnerElemTraverser] with Traverser[GraphTraversal.InnerElem, InnerElemTraverser]
    Attributes
    protected
    Definition Classes
    GraphTraversal
  26. trait InnerNode extends (AdjacencyListBase.this)#InnerNode
    Definition Classes
    AdjacencyListBase
  27. abstract class InnerNodeDownUpTraverser extends TraverserMethods[(Boolean, GraphTraversal.NodeT), InnerNodeDownUpTraverser] with Traverser[(Boolean, GraphTraversal.NodeT), InnerNodeDownUpTraverser]
    Definition Classes
    GraphTraversal
  28. abstract class InnerNodeImpl extends mutable.AdjacencyListGraph.This.NodeBase with mutable.AdjacencyListGraph.This.InnerNode with mutable.AdjacencyListGraph.This.InnerNode
    Definition Classes
    AdjacencyListGraph
  29. trait InnerNodeOps extends AnyRef
    Definition Classes
    EdgeOps
  30. abstract class InnerNodeTraverser extends TraverserMethods[GraphTraversal.NodeT, InnerNodeTraverser] with Traverser[GraphTraversal.NodeT, InnerNodeTraverser]
    Definition Classes
    GraphTraversal
  31. case class Layer extends Product with Serializable
    Definition Classes
    GraphTraversal
  32. final class LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]
    Definition Classes
    GraphTraversal
  33. type Layers = Traversable[This.Layer]
    Definition Classes
    GraphTraversal
  34. trait Node extends Serializable
    Definition Classes
    GraphBase
  35. abstract class NodeBase extends GraphLike.This.NodeBase with InnerNodeParam[N] with GraphLike.This.InnerNode
    Attributes
    protected
    Definition Classes
    GraphLike
  36. type NodeFilter = (This.NodeT) ⇒ Boolean
    Definition Classes
    GraphBase
  37. sealed trait NodeOrdering extends Ordering[GraphBase.NodeT] with ElemOrdering
    Definition Classes
    GraphBase
  38. class NodeSet extends This.NodeSet
    Annotations
    @SerialVersionUID()
  39. type NodeSetT = This.NodeSet
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphBase
  40. abstract type NodeT <: This.InnerNodeImpl
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphTraversal → GraphBase
  41. abstract class OuterEdgeTraverser extends TraverserMethods[E[N], OuterEdgeTraverser] with Traverser[E[N], OuterEdgeTraverser]
    Definition Classes
    GraphTraversal
  42. trait OuterElemTraverser extends TraverserMethods[OuterElem[N, E], OuterElemTraverser] with Traverser[OuterElem[N, E], OuterElemTraverser]
    Definition Classes
    GraphTraversal
  43. abstract class OuterNodeDownUpTraverser extends TraverserMethods[(Boolean, N), OuterNodeDownUpTraverser] with Traverser[(Boolean, N), OuterNodeDownUpTraverser]
    Definition Classes
    GraphTraversal
  44. abstract class OuterNodeTraverser extends TraverserMethods[N, OuterNodeTraverser] with Traverser[N, OuterNodeTraverser]
    Definition Classes
    GraphTraversal
  45. trait Path extends Walk
    Definition Classes
    GraphTraversal
  46. trait PathBuilder extends WalkBuilder with Builder[GraphTraversal.InnerElem, Path]
    Definition Classes
    GraphTraversal
  47. trait Properties extends SubgraphProperties
    Attributes
    protected
    Definition Classes
    GraphTraversal
  48. type Self = This[N, E]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  49. abstract class StrongComponentTraverser extends FluentProperties[StrongComponentTraverser] with Properties with Traversable[Component]
    Definition Classes
    GraphTraversal
  50. trait SubgraphProperties extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphTraversal
  51. type ThisGraph = AdjacencyListGraph.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
  52. final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]
    Definition Classes
    GraphTraversal
  53. trait Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with Traversable[A]
    Definition Classes
    GraphTraversal
  54. trait TraverserInnerNode extends GraphTraversal.InnerNode
    Definition Classes
    GraphTraversal
  55. abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]
    Attributes
    protected
    Definition Classes
    GraphTraversal
  56. trait Walk extends Traversable[GraphTraversal.InnerElem]
    Definition Classes
    GraphTraversal
  57. trait WalkBuilder extends Builder[GraphTraversal.InnerElem, Walk]
    Definition Classes
    GraphTraversal
  58. class Weight extends AnyRef
    Definition Classes
    GraphTraversal
  59. class WithFilter extends FilterMonadic[A, Repr]
    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
    Definition Classes
    GraphTraversal
  2. implicit abstract def config: generic.GraphConstrainedCompanion.Config with This.Config
    Definition Classes
    GraphLike
  3. abstract val constraintFactory: ConstraintCompanion[Constraint]
    Definition Classes
    GraphLike
  4. implicit abstract val edgeT: ClassTag[E[N]]
    Definition Classes
    GraphLike
  5. abstract def edges: This.EdgeSetT
    Definition Classes
    AdjacencyListGraph → GraphBase
  6. abstract def empty: This[N, E]
    Definition Classes
    SetLike
  7. abstract val graphCompanion: GraphConstrainedCompanion[This]
    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
    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
    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
    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
    Definition Classes
    GraphTraversal
  12. abstract def newNodeSet: This.NodeSetT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  13. abstract def newNodeWithHints(node: N, hints: Hints): This.NodeT
    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
    Definition Classes
    GraphTraversal
  15. abstract def newWalkBuilder(start: This.NodeT)(implicit sizeHint: Int, edgeSelector: (This.NodeT, This.NodeT) ⇒ Option[This.EdgeT]): This.WalkBuilder
    Definition Classes
    GraphTraversal
  16. abstract def nodes: This.NodeSetT
    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
    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
    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
    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
    Definition Classes
    GraphTraversal
  21. abstract def preAdd(edge: E[N]): PreCheckResult

    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

    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

    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

    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]

    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]]
    Definition Classes
    GenSetLike → Parallelizable → GenTraversableOnce
  27. abstract def strongComponentTraverser(parameters: Parameters, subgraphNodes: This.NodeFilter, subgraphEdges: This.EdgeFilter, ordering: This.ElemOrdering, maxWeight: Option[This.Weight]): This.StrongComponentTraverser
    Definition Classes
    GraphTraversal

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[Param[N, E]]): This[N, E]
    Definition Classes
    GenSetLike
  4. def &=(coll: Iterable[Param[N, E]]): AdjacencyListGraph.this.type
    Definition Classes
    GraphLike
  5. def &~(that: GenSet[Param[N, E]]): This[N, E]
    Definition Classes
    GenSetLike
  6. def +(node: N): This[N, E]
    Definition Classes
    GraphLike → GraphLike → GraphLike
  7. def +(elem: Param[N, E]): This[N, E]
    Definition Classes
    GraphLike → SetLike → GenSetLike
  8. def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): This[N, E]
    Definition Classes
    SetLike
  9. final def +#(edge: E[N]): This[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  10. def ++(elems: GenTraversableOnce[Param[N, E]]): AdjacencyListGraph.this.type
    Definition Classes
    GraphLike → GraphLike → SetLike
  11. def ++[B >: Param[N, E], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  12. def ++:[B >: Param[N, E], That](that: Traversable[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
    Definition Classes
    TraversableLike
  13. def ++:[B >: Param[N, E], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
    Definition Classes
    TraversableLike
  14. def ++=(elems: TraversableOnce[Param[N, E]]): AdjacencyListGraph.this.type
    Definition Classes
    GraphLike → GraphLike → Growable
  15. def +=(elem: Param[N, E]): AdjacencyListGraph.this.type
    Definition Classes
    GraphLike → Growable
  16. final def +=(node: N): AdjacencyListGraph.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  17. def +=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): AdjacencyListGraph.this.type
    Definition Classes
    Growable
  18. final def +=#(edge: E[N]): AdjacencyListGraph.this.type
    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: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): AdjacencyListGraph.this.type
    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: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): AdjacencyListGraph.this.type
    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: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind): AdjacencyListGraph.this.type
    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: Double)(implicit edgeFactory: WEdgeCompanion[EE]): AdjacencyListGraph.this.type
    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
    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
    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
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  26. final def +~=(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): AdjacencyListGraph.this.type
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  27. final def -(edge: E[N]): This[N, E]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  28. final def -(node: N): This[N, E]
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  29. def -(elem: Param[N, E]): This[N, E]
    Definition Classes
    GraphLike → SetLike → Subtractable → GenSetLike
  30. def -(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): This[N, E]
    Definition Classes
    Subtractable
  31. final def -!(edge: E[N]): This[N, E]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  32. def -!(elem: Param[N, E]): This[N, E]
    Definition Classes
    GraphLike
  33. final def -!#(edge: E[N]): This[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  34. def -!=(elem: Param[N, E]): AdjacencyListGraph.this.type
    Definition Classes
    GraphLike
  35. final def -!=#(edge: E[N]): AdjacencyListGraph.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  36. final def -#(edge: E[N]): This[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  37. def --(elems: GenTraversableOnce[Param[N, E]]): This[N, E]
    Definition Classes
    GraphLike → GraphLike → Subtractable
  38. def --!(elems: GenTraversableOnce[Param[N, E]]): This[N, E]
    Definition Classes
    GraphLike
  39. final def --!=(coll: Iterable[Param[N, E]]): This[N, E]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  40. def --=(elems: TraversableOnce[Param[N, E]]): AdjacencyListGraph.this.type
    Definition Classes
    GraphLike → Shrinkable
  41. def -=(elem: Param[N, E]): AdjacencyListGraph.this.type
    Definition Classes
    GraphLike → Shrinkable
  42. final def -=(node: N): AdjacencyListGraph.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  43. def -=(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): AdjacencyListGraph.this.type
    Definition Classes
    Shrinkable
  44. final def -=#(edge: E[N]): AdjacencyListGraph.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  45. def ->[B](y: B): (AdjacencyListGraph[N, E, This], B)
    Implicit
    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]
    Definition Classes
    GraphLike → GraphLike
    Annotations
    @inline()
  47. final def -?=(node: N): AdjacencyListGraph.this.type
    Definition Classes
    GraphLike
    Annotations
    @inline()
  48. def /:[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  49. def :\[B](z: B)(op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  51. final def add(edge: E[N]): Boolean
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  52. final def add(node: N): Boolean
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  53. final def addAndGet(edge: E[N]): This.EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  54. final def addAndGet(node: N): This.NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  55. def addAndGetEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind): This.EdgeT
    Definition Classes
    EdgeOps
  56. final def addAndGetEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): This.EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  57. 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
    Definition Classes
    EdgeOps
  58. 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
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  59. 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): This.EdgeT
    Definition Classes
    EdgeOps
  60. 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]): This.EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  61. 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): This.EdgeT
    Definition Classes
    EdgeOps
  62. 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]): This.EdgeT
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  63. final def addEdge(node_1: N, node_2: N, nodes: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  64. final def addEdge(node_1: N, node_2: N)(implicit edgeFactory: EdgeCompanion[E]): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  65. 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
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  66. 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
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  67. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  68. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  69. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  70. 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): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  71. 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
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  72. 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): Boolean
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  73. 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
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  74. def aggregate[B](z: ⇒ B)(seqop: (B, Param[N, E]) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  75. def allNodes(innerNodes: Set[Graph.NodeT], innerEdges: Set[Graph.EdgeT]): Set[Graph.NodeT]

    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
  76. def allNodes(passedNodes: Traversable[N], passedEdges: Traversable[E[N]]): Set[N]

    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
  77. def andThen[A](g: (Boolean) ⇒ A): (Param[N, E]) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  78. final val anyEdge: This.EdgeFilter
    Definition Classes
    GraphBase
  79. final def anyEdgeSelector(from: This.NodeT, to: This.NodeT): Option[This.EdgeT]
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  80. final val anyNode: This.NodeFilter
    Definition Classes
    GraphBase
  81. final lazy val anyOrdering: AnyOrdering[N]
    Attributes
    protected
    Definition Classes
    GraphBase
  82. def apply(elem: Param[N, E]): Boolean
    Definition Classes
    GenSetLike → Function1
  83. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  84. def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: This.NodeOrdering, ordEdge: This.EdgeOrdering): String
    Definition Classes
    GraphLike
  85. final def bulkOp(elems: GenTraversableOnce[Param[N, E]], isPlusPlus: Boolean): This[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  86. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  87. val checkSuspended: Boolean

    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
    Annotations
    @transient()
  88. def checkedAdd[G >: This[N, E]](contained: ⇒ Boolean, preAdd: ⇒ PreCheckResult, copy: ⇒ G, nodes: ⇒ Traversable[N], edges: ⇒ Traversable[E[N]]): This[N, E]

    generic checked addition

    generic checked addition

    Attributes
    protected
    Definition Classes
    GraphLike
  89. final def clear(): Unit
    Definition Classes
    AdjacencyListGraph → Growable → Clearable
    Annotations
    @inline()
  90. def clone(): This[N, E]
    Definition Classes
    GraphLike → Cloneable → AnyRef
  91. def collect[B, That](pf: PartialFunction[Param[N, E], B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  92. def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
    Definition Classes
    TraversableOnce
  93. def compose[A](g: (A) ⇒ Param[N, E]): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  94. def contains(elem: Param[N, E]): Boolean
    Definition Classes
    GraphLike → SetLike → GenSetLike
  95. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  96. def copyToArray[B >: Param[N, E]](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  99. def count(p: (Param[N, E]) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. final lazy val defaultEdgeOrdering: This.EdgeOrdering
    Definition Classes
    GraphBase
  101. final lazy val defaultNodeOrdering: This.NodeOrdering
    Definition Classes
    GraphBase
  102. final def defaultPathSize: Int
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  103. def degreeCount(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, Int]
    Definition Classes
    GraphDegree
  104. def degreeNodeSeq(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[This.DegreeNodeSeqEntry]
    Definition Classes
    GraphDegree
  105. def degreeNodesMap(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, AnySet[This.NodeT]]
    Definition Classes
    GraphDegree
  106. def degreeSeq(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[Int]
    Definition Classes
    GraphDegree
  107. def degreeSet(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedSet[Int]
    Definition Classes
    GraphDegree
  108. def diff(that: GenSet[Param[N, E]]): This[N, E]
    Definition Classes
    SetLike → GenSetLike
  109. def drop(n: Int): This[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  110. def dropRight(n: Int): This[N, E]
    Definition Classes
    IterableLike
  111. def dropWhile(p: (Param[N, E]) ⇒ Boolean): This[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  112. def edgeIterator: GroupIterator[This.EdgeT] { ... /* 2 definitions in type refinement */ }
    Definition Classes
    AdjacencyListBase
  113. implicit final def edgeToEdgeCont(e: E[N]): E[This.NodeT]
    Attributes
    protected
    Definition Classes
    GraphBase
  114. def ensuring(cond: (AdjacencyListGraph[N, E, This]) ⇒ Boolean, msg: ⇒ Any): AdjacencyListGraph[N, E, This]
    Implicit
    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
  115. def ensuring(cond: (AdjacencyListGraph[N, E, This]) ⇒ Boolean): AdjacencyListGraph[N, E, This]
    Implicit
    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
  116. def ensuring(cond: Boolean, msg: ⇒ Any): AdjacencyListGraph[N, E, This]
    Implicit
    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
  117. def ensuring(cond: Boolean): AdjacencyListGraph[N, E, This]
    Implicit
    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
  118. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  119. def equals(that: Any): Boolean
    Definition Classes
    GraphLike → GenSetLike → Equals → AnyRef → Any
  120. def exists(p: (Param[N, E]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  121. def filter(p: (Param[N, E]) ⇒ Boolean): This[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  122. def filterNot(p: (Param[N, E]) ⇒ Boolean): This[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  123. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  124. final def find(outerEdge: E[N]): Option[This.EdgeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  125. final def find(outerNode: N): Option[This.NodeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  126. def find(p: (Param[N, E]) ⇒ Boolean): Option[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  127. final def findCycle[U](implicit visitor: (This.InnerElem) ⇒ U): Option[This.Cycle]
    Definition Classes
    GraphTraversal
  128. def flatMap[B, That](f: (Param[N, E]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  129. def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def foldLeft[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def foldRight[B](z: B)(op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  132. def forall(p: (Param[N, E]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  133. def foreach[U](f: (Param[N, E]) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  134. def formatted(fmtstr: String): String
    Implicit
    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()
  135. final def get(outerEdge: E[N]): This.EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  136. final def get(outerNode: N): This.NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  137. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  138. final def getOrElse(outerEdge: E[N], default: This.EdgeT): This.EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  139. final def getOrElse(outerNode: N, default: This.NodeT): This.NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  140. def graphSize: Int
    Definition Classes
    GraphBase
  141. def groupBy[K](f: (Param[N, E]) ⇒ K): Map[K, This[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  142. def grouped(size: Int): Iterator[This[N, E]]
    Definition Classes
    IterableLike
  143. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  144. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  145. def having(node: This.NodeFilter, edge: This.EdgeFilter): PartialFunction[Param[N, E], Boolean]
    Definition Classes
    GraphLike
  146. def head: Param[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  147. def headOption: Option[Param[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  148. def init: This[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  149. def initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
  150. def initializeFrom(in: ObjectInputStream, nodes: This.NodeSetT, edges: This.EdgeSetT): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  151. def inits: Iterator[This[N, E]]
    Definition Classes
    TraversableLike
  152. def intersect(that: GenSet[Param[N, E]]): This[N, E]
    Definition Classes
    GenSetLike
  153. final def isAcyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  154. def isComplete: Boolean
    Definition Classes
    GraphTraversal
  155. def isConnected: Boolean
    Definition Classes
    GraphTraversal
  156. final def isCustomEdgeFilter(f: This.EdgeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  157. final def isCustomNodeFilter(f: This.NodeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  158. final def isCyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  159. def isDefined: Boolean
    Implicit
    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
  160. def isDirected: Boolean
    Definition Classes
    GraphLike → GraphBase
  161. final val isDirectedT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  162. def isEdge: Boolean
    Implicit
    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
  163. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  164. def isHyper: Boolean
    Definition Classes
    GraphLike → GraphBase
  165. final val isHyperT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  166. def isIn: Boolean
    Implicit
    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
  167. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  168. def isMulti: Boolean
    Definition Classes
    GraphLike → GraphBase
  169. final val isMultiT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  170. def isNode: Boolean
    Implicit
    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
  171. def isOut: Boolean
    Implicit
    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 isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  173. final def isTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  174. def iterator: Iterator[OutParam[N, E] with Serializable with This.InnerElem]
    Definition Classes
    GraphLike → GenSetLike → IterableLike → GenIterableLike
  175. def last: Param[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  176. def lastOption: Option[Param[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  177. def map[B, That](f: (Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[This[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.

  178. def max[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  179. def maxBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  180. def maxDegree(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  181. def min[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  182. def minBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  183. def minDegree(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  184. def minusMinus(delNodes: Traversable[N], delEdges: Traversable[E[N]]): This[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  185. def minusMinusNodesEdges(delNodes: Traversable[N], delEdges: Traversable[E[N]]): (Set[N], Set[E[N]])
    Attributes
    protected
    Definition Classes
    GraphLike
  186. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  187. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  188. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  189. val n1: AdjacencyListGraph[N, E, This]
    Implicit
    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
  190. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  191. def newBuilder: Builder[Param[N, E], This[N, E]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  192. final def newEdge(innerEdge: E[This.NodeT]): This.EdgeT
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
    Annotations
    @inline()
  193. final def newEdgeTArray(size: Int): Array[This.EdgeT]
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase
    Annotations
    @inline()
  194. final def newNode(n: N): This.NodeT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase → GraphBase
    Annotations
    @inline()
  195. final val noNode: This.NodeFilter
    Definition Classes
    GraphBase
  196. 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]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  197. 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]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  198. final def nodesToEdge(edgeFactory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit endpointsKind: CollectionKind): This.EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  199. final def nodesToEdge(edgeFactory: EdgeCompanion[E], node_1: N, node_2: N): This.EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  200. def nodesToEdgeCont(factory: EdgeCompanion[E], node_1: N, node_2: N): E[This.NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  201. def nodesToEdgeCont(factory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[This.NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  202. 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
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  203. 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
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  204. 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]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  205. 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]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  206. 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): This.EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  207. final def nodesToWEdge[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](edgeFactory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): This.EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  208. def nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](factory: WEdgeCompanion[EE], weight: Double, node_1: N, node_2: N): E[This.NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  209. 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[This.NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  210. 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): This.EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  211. 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): This.EdgeT
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  212. 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[This.NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  213. 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[This.NodeT]
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  214. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  215. final def nonTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  216. final def notify(): Unit
    Definition Classes
    AnyRef
  217. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  218. def onAdditionRefused(refusedNodes: Traversable[N], refusedEdges: Traversable[E[N]], graph: constrained.Graph[N, E]): Boolean

    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
  219. def onSubtractionRefused(refusedNodes: Traversable[Graph.NodeT], refusedEdges: Traversable[Graph.EdgeT], graph: constrained.Graph[N, E]): Boolean

    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
  220. def order: Int
    Definition Classes
    GraphBase
  221. def par: ParSet[Param[N, E]]
    Definition Classes
    Parallelizable
  222. def parCombiner: Combiner[Param[N, E], ParSet[Param[N, E]]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  223. final def partition(elems: GenTraversableOnce[Param[N, E]]): Partitions[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  224. def partition(p: (Param[N, E]) ⇒ Boolean): (This[N, E], This[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  225. def plusPlus(newNodes: Traversable[N], newEdges: Traversable[E[N]]): This[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  226. def postAdd(newGraph: constrained.Graph[N, E], passedNodes: Traversable[N], passedEdges: Traversable[E[N]], preCheck: PreCheckResult): Boolean

    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
  227. def postSubtract(newGraph: constrained.Graph[N, E], passedNodes: Traversable[N], passedEdges: Traversable[E[N]], preCheck: PreCheckResult): Boolean

    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
  228. def preAdd(elems: InParam[N, E]*): PreCheckResult

    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
  229. def preCreate(nodes: Traversable[N], edges: Traversable[E[N]]): PreCheckResult

    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
  230. def preSubtract(nodes: ⇒ Set[Graph.NodeT], edges: ⇒ Set[Graph.EdgeT], simple: Boolean): PreCheckResult

    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
  231. def product[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  232. def reduce[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  233. def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce
  234. def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  235. def reduceOption[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  236. def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  237. def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  238. final def remove(edge: E[N]): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  239. final def remove(node: N): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  240. final def removeGently(node: N): Boolean
    Definition Classes
    GraphLike
  241. final def removeWithNodes(edge: E[N]): Boolean
    Definition Classes
    GraphLike
    Annotations
    @inline()
  242. def repr: This[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  243. def reversed: List[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  244. def sameElements[B >: Param[N, E]](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  245. def scan[B >: Param[N, E], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[This[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  246. def scanLeft[B, That](z: B)(op: (B, Param[N, E]) ⇒ B)(implicit bf: CanBuildFrom[This[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  247. def scanRight[B, That](z: B)(op: (Param[N, E], B) ⇒ B)(implicit bf: CanBuildFrom[This[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.

  248. final def serializeTo(out: ObjectOutputStream): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  249. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  250. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  251. def slice(from: Int, until: Int): This[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  252. def sliding(size: Int, step: Int): Iterator[This[N, E]]
    Definition Classes
    IterableLike
  253. def sliding(size: Int): Iterator[This[N, E]]
    Definition Classes
    IterableLike
  254. def span(p: (Param[N, E]) ⇒ Boolean): (This[N, E], This[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  255. def splitAt(n: Int): (This[N, E], This[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  256. def stringPrefix: String
    Definition Classes
    GraphLike → GraphLike → SetLike → TraversableLike → GenTraversableLike
  257. def subsetOf(that: GenSet[Param[N, E]]): Boolean
    Definition Classes
    GenSetLike
  258. def subsets(): Iterator[This[N, E]]
    Definition Classes
    SetLike
  259. def subsets(len: Int): Iterator[This[N, E]]
    Definition Classes
    SetLike
  260. def sum[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  261. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  262. def tail: This[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  263. def tails: Iterator[This[N, E]]
    Definition Classes
    TraversableLike
  264. def take(n: Int): This[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  265. def takeRight(n: Int): This[N, E]
    Definition Classes
    IterableLike
  266. def takeWhile(p: (Param[N, E]) ⇒ Boolean): This[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  267. def thisCollection: Iterable[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  268. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[N, E], Col[Param[N, E]]]): Col[Param[N, E]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  269. def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  270. def toBuffer[A1 >: Param[N, E]]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  271. def toCollection(repr: This[N, E]): Iterable[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  272. def toIndexedSeq: IndexedSeq[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  273. def toIterable: Iterable[Param[N, E]]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  274. def toIterator: Iterator[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  275. def toList: List[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  276. def toMap[T, U](implicit ev: <:<[Param[N, E], (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  277. def toParArray: ParArray[T]
    Implicit
    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
  278. def toSeq: Seq[Param[N, E]]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  279. def toSet[B >: Param[N, E]]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  280. def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: This.NodeOrdering, ordEdge: This.EdgeOrdering): String
    Definition Classes
    GraphLike
  281. def toStream: Stream[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  282. def toString(): String
    Definition Classes
    GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any
  283. def toTraversable: Traversable[Param[N, E]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  284. def toVector: Vector[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  285. final def topologicalSort[U](implicit visitor: (This.InnerElem) ⇒ U): This.CycleNodeOrTopologicalOrder
    Definition Classes
    GraphTraversal
  286. final def topologicalSortByComponent[U](implicit visitor: (This.InnerElem) ⇒ U): Traversable[This.CycleNodeOrTopologicalOrder]
    Definition Classes
    GraphTraversal
  287. def totalDegree(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  288. def totalWeight: Double
    Definition Classes
    GraphBase
  289. def union(that: GenSet[Param[N, E]]): This[N, E]
    Definition Classes
    SetLike → GenSetLike
  290. final def upsert(edge: E[N]): Boolean
    Definition Classes
    AdjacencyListGraph → GraphLike
    Annotations
    @inline()
  291. val value: AdjacencyListGraph[N, E, This]
    Implicit
    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
  292. def view(from: Int, until: Int): IterableView[Param[N, E], This[N, E]]
    Definition Classes
    IterableLike → TraversableLike
  293. def view: IterableView[Param[N, E], This[N, E]]
    Definition Classes
    IterableLike → TraversableLike
  294. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  295. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  296. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  297. def withFilter(p: (Param[N, E]) ⇒ Boolean): FilterMonadic[Param[N, E], This[N, E]]
    Definition Classes
    TraversableLike → FilterMonadic
  298. final def withoutChecks[R](exec: ⇒ R): R
    Attributes
    protected
    Definition Classes
    GraphLike
  299. def zip[A1 >: Param[N, E], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[This[N, E], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  300. 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
    Definition Classes
    IterableLike → GenIterableLike
  301. def zipWithIndex[A1 >: Param[N, E], That](implicit bf: CanBuildFrom[This[N, E], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  302. def |(that: GenSet[Param[N, E]]): This[N, E]
    Definition Classes
    GenSetLike
  303. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    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()
  304. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    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()
  305. def [B](y: B): (AdjacencyListGraph[N, E, This], B)
    Implicit
    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
  306. object Edge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  307. object InnerEdge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  308. object InnerNode extends Serializable
    Definition Classes
    GraphBase
  309. object Node extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  310. object TraverserInnerNode extends Serializable
    Definition Classes
    GraphTraversal
    Annotations
    @transient()

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    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
    Implicit
    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
    Implicit
    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
    Implicit
    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]]
    Implicit
    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]
    Implicit
    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]
    Implicit
    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
    Implicit
    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
    Implicit
    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
    Implicit
    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]]
    Implicit
    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