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 immutable
    Definition Classes
    constrained
  • AdjacencyListGraph
  • DefaultGraphImpl
  • Graph
  • 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 immutable.AdjacencyListGraph[N, E, This]

Self Type
This[N, E]
Linear Supertypes
immutable.AdjacencyListGraph[N, E, This], AdjacencyListBase[N, E, This], GraphLike[N, E, This], Constrained[N, E], ConstraintHandlerMethods[N, E], ConstraintMethods[N, E], 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
DefaultGraphImpl, UserConstrainedGraphImpl
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AdjacencyListGraph
  2. AdjacencyListGraph
  3. AdjacencyListBase
  4. GraphLike
  5. Constrained
  6. ConstraintHandlerMethods
  7. ConstraintMethods
  8. GraphLike
  9. GraphDegree
  10. GraphTraversal
  11. GraphBase
  12. Serializable
  13. Serializable
  14. SetLike
  15. Subtractable
  16. GenSetLike
  17. Function1
  18. IterableLike
  19. GenIterableLike
  20. TraversableLike
  21. GenTraversableLike
  22. Parallelizable
  23. TraversableOnce
  24. GenTraversableOnce
  25. FilterMonadic
  26. HasNewBuilder
  27. Equals
  28. AnyRef
  29. 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, (collection.GraphLike.this)#NodeT, E] with (collection.GraphLike.this)#InnerEdge
    Definition Classes
    GraphLike
  12. type EdgeFilter = (This.EdgeT) ⇒ Boolean
    Definition Classes
    GraphBase
  13. sealed trait EdgeOrdering extends Ordering[GraphBase.EdgeT] with ElemOrdering
    Definition Classes
    GraphBase
  14. class EdgeSet extends immutable.AdjacencyListGraph.This.EdgeSet
    Definition Classes
    AdjacencyListGraph
  15. type EdgeSetT = This.EdgeSet
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphBase
  16. type EdgeT = This.EdgeBase
    Definition Classes
    AdjacencyListGraph → GraphLike → GraphBase
  17. sealed trait ElemOrdering extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphBase
  18. trait ExtendedNodeVisitor[U] extends (GraphTraversal.NodeT) ⇒ U
    Definition Classes
    GraphTraversal
  19. trait Filter[T] extends (T) ⇒ Boolean
    Definition Classes
    GraphDegree
  20. abstract class FluentProperties[+This <: FluentProperties[This]] extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphTraversal
  21. trait InnerEdge extends (collection.GraphLike.this)#InnerEdge
    Definition Classes
    GraphLike
  22. abstract class InnerEdgeTraverser extends TraverserMethods[GraphTraversal.EdgeT, InnerEdgeTraverser] with Traverser[GraphTraversal.EdgeT, InnerEdgeTraverser]
    Definition Classes
    GraphTraversal
  23. sealed trait InnerElem extends AnyRef
    Definition Classes
    GraphBase
  24. abstract class InnerElemTraverser extends TraverserMethods[GraphTraversal.InnerElem, InnerElemTraverser] with Traverser[GraphTraversal.InnerElem, InnerElemTraverser]
    Attributes
    protected
    Definition Classes
    GraphTraversal
  25. trait InnerNode extends (AdjacencyListBase.this)#InnerNode
    Definition Classes
    AdjacencyListBase
  26. abstract class InnerNodeDownUpTraverser extends TraverserMethods[(Boolean, GraphTraversal.NodeT), InnerNodeDownUpTraverser] with Traverser[(Boolean, GraphTraversal.NodeT), InnerNodeDownUpTraverser]
    Definition Classes
    GraphTraversal
  27. abstract class InnerNodeImpl extends immutable.AdjacencyListGraph.This.NodeBase with immutable.AdjacencyListGraph.This.InnerNode
    Definition Classes
    AdjacencyListGraph
  28. abstract class InnerNodeTraverser extends TraverserMethods[GraphTraversal.NodeT, InnerNodeTraverser] with Traverser[GraphTraversal.NodeT, InnerNodeTraverser]
    Definition Classes
    GraphTraversal
  29. case class Layer extends Product with Serializable
    Definition Classes
    GraphTraversal
  30. final class LayeredTopologicalOrder[+A] extends AbstractTopologicalOrder[A, (Int, Iterable[A])]
    Definition Classes
    GraphTraversal
  31. type Layers = Traversable[This.Layer]
    Definition Classes
    GraphTraversal
  32. trait Node extends Serializable
    Definition Classes
    GraphBase
  33. abstract class NodeBase extends (collection.GraphLike.this)#NodeBase with InnerNodeParam[N] with (collection.GraphLike.this)#InnerNode
    Attributes
    protected
    Definition Classes
    GraphLike
  34. type NodeFilter = (This.NodeT) ⇒ Boolean
    Definition Classes
    GraphBase
  35. sealed trait NodeOrdering extends Ordering[GraphBase.NodeT] with ElemOrdering
    Definition Classes
    GraphBase
  36. class NodeSet extends immutable.AdjacencyListGraph.This.NodeSet
    Definition Classes
    AdjacencyListGraph
  37. type NodeSetT = This.NodeSet
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphBase
  38. abstract type NodeT <: This.InnerNodeImpl
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphTraversal → GraphBase
  39. abstract class OuterEdgeTraverser extends TraverserMethods[E[N], OuterEdgeTraverser] with Traverser[E[N], OuterEdgeTraverser]
    Definition Classes
    GraphTraversal
  40. trait OuterElemTraverser extends TraverserMethods[OuterElem[N, E], OuterElemTraverser] with Traverser[OuterElem[N, E], OuterElemTraverser]
    Definition Classes
    GraphTraversal
  41. abstract class OuterNodeDownUpTraverser extends TraverserMethods[(Boolean, N), OuterNodeDownUpTraverser] with Traverser[(Boolean, N), OuterNodeDownUpTraverser]
    Definition Classes
    GraphTraversal
  42. abstract class OuterNodeTraverser extends TraverserMethods[N, OuterNodeTraverser] with Traverser[N, OuterNodeTraverser]
    Definition Classes
    GraphTraversal
  43. trait Path extends Walk
    Definition Classes
    GraphTraversal
  44. trait PathBuilder extends WalkBuilder with Builder[GraphTraversal.InnerElem, Path]
    Definition Classes
    GraphTraversal
  45. trait Properties extends SubgraphProperties
    Attributes
    protected
    Definition Classes
    GraphTraversal
  46. type Self = This[N, E]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  47. abstract class StrongComponentTraverser extends FluentProperties[StrongComponentTraverser] with Properties with Traversable[Component]
    Definition Classes
    GraphTraversal
  48. trait SubgraphProperties extends AnyRef
    Attributes
    protected
    Definition Classes
    GraphTraversal
  49. type ThisGraph = AdjacencyListGraph.this.type
    Attributes
    protected
    Definition Classes
    GraphLike
  50. final class TopologicalOrder[+A] extends AbstractTopologicalOrder[A, A]
    Definition Classes
    GraphTraversal
  51. trait Traverser[A, +This <: Traverser[A, This]] extends TraverserMethods[A, This] with Properties with Traversable[A]
    Definition Classes
    GraphTraversal
  52. trait TraverserInnerNode extends GraphTraversal.InnerNode
    Definition Classes
    GraphTraversal
  53. abstract class TraverserMethods[A, +This <: TraverserMethods[A, This]] extends FluentProperties[This]
    Attributes
    protected
    Definition Classes
    GraphTraversal
  54. trait Walk extends Traversable[GraphTraversal.InnerElem]
    Definition Classes
    GraphTraversal
  55. trait WalkBuilder extends Builder[GraphTraversal.InnerElem, Walk]
    Definition Classes
    GraphTraversal
  56. class Weight extends AnyRef
    Definition Classes
    GraphTraversal
  57. 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. abstract def copy(nodes: Traversable[N], edges: Traversable[E[N]]): This[N, E]
    Definition Classes
    AdjacencyListGraph
  5. implicit abstract val edgeT: ClassTag[E[N]]
    Definition Classes
    GraphLike
  6. abstract def edges: This.EdgeSetT
    Definition Classes
    AdjacencyListGraph → GraphBase
  7. abstract def empty: This[N, E]
    Definition Classes
    SetLike
  8. abstract val graphCompanion: GraphConstrainedCompanion[This]
    Definition Classes
    GraphLike → GraphLike
  9. 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
  10. 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
  11. 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
  12. 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
  13. abstract def newNodeSet: This.NodeSetT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  14. abstract def newNodeWithHints(node: N, hints: Hints): This.NodeT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  15. abstract def newPathBuilder(start: This.NodeT)(implicit sizeHint: Int, edgeSelector: (This.NodeT, This.NodeT) ⇒ Option[This.EdgeT]): This.PathBuilder
    Definition Classes
    GraphTraversal
  16. abstract def newWalkBuilder(start: This.NodeT)(implicit sizeHint: Int, edgeSelector: (This.NodeT, This.NodeT) ⇒ Option[This.EdgeT]): This.WalkBuilder
    Definition Classes
    GraphTraversal
  17. abstract def nodes: This.NodeSetT
    Definition Classes
    AdjacencyListGraph → GraphBase
  18. 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
  19. 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
  20. 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
  21. 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
  22. 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 possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  23. 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 possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  24. 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 possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  25. 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 possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  26. 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
  27. abstract def seq: Set[Param[N, E]]
    Definition Classes
    GenSetLike → Parallelizable → GenTraversableOnce
  28. 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 &~(that: GenSet[Param[N, E]]): This[N, E]
    Definition Classes
    GenSetLike
  5. def +(node: N): This[N, E]
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  6. def +(elem: Param[N, E]): This[N, E]
    Definition Classes
    GraphLike → SetLike → GenSetLike
  7. def +(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): This[N, E]
    Definition Classes
    SetLike
  8. def +#(edge: E[N]): This[N, E]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  9. def ++(elems: GenTraversableOnce[Param[N, E]]): AdjacencyListGraph.this.type
    Definition Classes
    GraphLike → GraphLike → SetLike
  10. def ++[B >: Param[N, E], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  11. def ++:[B >: Param[N, E], That](that: Traversable[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
    Definition Classes
    TraversableLike
  12. def ++:[B >: Param[N, E], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
    Definition Classes
    TraversableLike
  13. def -(n: N): This[N, E]
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  14. def -(elem: Param[N, E]): This[N, E]
    Definition Classes
    GraphLike → SetLike → Subtractable → GenSetLike
  15. def -(elem1: Param[N, E], elem2: Param[N, E], elems: Param[N, E]*): This[N, E]
    Definition Classes
    Subtractable
  16. def -!(elem: Param[N, E]): This[N, E]
    Definition Classes
    GraphLike
  17. def -!#(e: E[N]): This[N, E]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  18. def -#(e: E[N]): This[N, E]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  19. def --(elems: GenTraversableOnce[Param[N, E]]): This[N, E] with GraphLike[N, E, This] with Set[Param[N, E]] with constrained.Graph[N, E]
    Definition Classes
    GraphLike → GraphLike → Subtractable
  20. def --!(elems: GenTraversableOnce[Param[N, E]]): This[N, E]
    Definition Classes
    GraphLike
  21. 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()
  22. def -?(n: N): This[N, E]
    Definition Classes
    AdjacencyListGraph → AdjacencyListGraph → GraphLike
  23. def /:[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  24. def :\[B](z: B)(op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  26. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  27. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  28. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  29. def aggregate[B](z: ⇒ B)(seqop: (B, Param[N, E]) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  30. 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
  31. def andThen[A](g: (Boolean) ⇒ A): (Param[N, E]) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  32. final val anyEdge: This.EdgeFilter
    Definition Classes
    GraphBase
  33. final def anyEdgeSelector(from: This.NodeT, to: This.NodeT): Option[This.EdgeT]
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  34. final val anyNode: This.NodeFilter
    Definition Classes
    GraphBase
  35. final lazy val anyOrdering: AnyOrdering[N]
    Attributes
    protected
    Definition Classes
    GraphBase
  36. def apply(elem: Param[N, E]): Boolean
    Definition Classes
    GenSetLike → Function1
  37. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  38. def asSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: This.NodeOrdering, ordEdge: This.EdgeOrdering): String
    Definition Classes
    GraphLike
  39. final def bulkOp(elems: GenTraversableOnce[Param[N, E]], isPlusPlus: Boolean): This[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  40. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  41. def checkSuspended: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  42. def checkedAdd[G >: This[N, E]](contained: ⇒ Boolean, preAdd: ⇒ PreCheckResult, copy: ⇒ G, nodes: ⇒ Traversable[N], edges: ⇒ Traversable[E[N]]): This[N, E]

    generic constrained addition

    generic constrained addition

    Attributes
    protected
  43. def checkedSubtractEdge[G >: This[N, E]](edge: E[N], simple: Boolean, copy: (E[N], This.EdgeT) ⇒ G): This[N, E]

    generic constrained subtraction of edges

    generic constrained subtraction of edges

    Attributes
    protected
  44. def checkedSubtractNode[G >: This[N, E]](node: N, forced: Boolean, copy: (N, This.NodeT) ⇒ G): This[N, E]

    generic constrained subtraction of nodes

    generic constrained subtraction of nodes

    Attributes
    protected
  45. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  46. def collect[B, That](pf: PartialFunction[Param[N, E], B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  47. def collectFirst[B](pf: PartialFunction[Param[N, E], B]): Option[B]
    Definition Classes
    TraversableOnce
  48. def compose[A](g: (A) ⇒ Param[N, E]): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  49. def contains(elem: Param[N, E]): Boolean
    Definition Classes
    GraphLike → SetLike → GenSetLike
  50. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  51. def copyToArray[B >: Param[N, E]](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  52. def copyToArray[B >: Param[N, E]](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  53. def copyToBuffer[B >: Param[N, E]](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  54. def count(p: (Param[N, E]) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  55. final lazy val defaultEdgeOrdering: This.EdgeOrdering
    Definition Classes
    GraphBase
  56. final lazy val defaultNodeOrdering: This.NodeOrdering
    Definition Classes
    GraphBase
  57. final def defaultPathSize: Int
    Attributes
    protected
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  58. def degreeCount(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, Int]
    Definition Classes
    GraphDegree
  59. def degreeNodeSeq(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[This.DegreeNodeSeqEntry]
    Definition Classes
    GraphDegree
  60. def degreeNodesMap(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedMap[Int, AnySet[This.NodeT]]
    Definition Classes
    GraphDegree
  61. def degreeSeq(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Seq[Int]
    Definition Classes
    GraphDegree
  62. def degreeSet(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): SortedSet[Int]
    Definition Classes
    GraphDegree
  63. def diff(that: GenSet[Param[N, E]]): This[N, E]
    Definition Classes
    SetLike → GenSetLike
  64. def drop(n: Int): This[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  65. def dropRight(n: Int): This[N, E]
    Definition Classes
    IterableLike
  66. def dropWhile(p: (Param[N, E]) ⇒ Boolean): This[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  67. def edgeIterator: GroupIterator[This.EdgeT] { ... /* 2 definitions in type refinement */ }
    Definition Classes
    AdjacencyListBase
  68. implicit final def edgeToEdgeCont(e: E[N]): E[This.NodeT]
    Attributes
    protected
    Definition Classes
    GraphBase
  69. 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
  70. 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
  71. 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
  72. 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
  73. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  74. def equals(that: Any): Boolean
    Definition Classes
    GraphLike → GenSetLike → Equals → AnyRef → Any
  75. def exists(p: (Param[N, E]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  76. def filter(p: (Param[N, E]) ⇒ Boolean): This[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  77. def filterNot(p: (Param[N, E]) ⇒ Boolean): This[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  78. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  79. final def find(outerEdge: E[N]): Option[This.EdgeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  80. final def find(outerNode: N): Option[This.NodeT]
    Definition Classes
    GraphLike
    Annotations
    @inline()
  81. def find(p: (Param[N, E]) ⇒ Boolean): Option[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  82. final def findCycle[U](implicit visitor: (This.InnerElem) ⇒ U): Option[This.Cycle]
    Definition Classes
    GraphTraversal
  83. final def findCycleContaining[U](node: This.NodeT)(implicit visitor: (This.InnerElem) ⇒ U): Option[This.Cycle]
    Definition Classes
    GraphTraversal
  84. def flatMap[B, That](f: (Param[N, E]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[This[N, E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  85. def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def foldLeft[B](z: B)(op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def foldRight[B](z: B)(op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  88. def forall(p: (Param[N, E]) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  89. def foreach[U](f: (Param[N, E]) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  90. 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()
  91. final def get(outerEdge: E[N]): This.EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  92. final def get(outerNode: N): This.NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  93. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  94. final def getOrElse(outerEdge: E[N], default: This.EdgeT): This.EdgeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  95. final def getOrElse(outerNode: N, default: This.NodeT): This.NodeT
    Definition Classes
    GraphLike
    Annotations
    @inline()
  96. def graphSize: Int
    Definition Classes
    GraphBase
  97. def groupBy[K](f: (Param[N, E]) ⇒ K): Map[K, This[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  98. def grouped(size: Int): Iterator[This[N, E]]
    Definition Classes
    IterableLike
  99. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  100. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  101. def having(node: This.NodeFilter, edge: This.EdgeFilter): PartialFunction[Param[N, E], Boolean]
    Definition Classes
    GraphLike
  102. def head: Param[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  103. def headOption: Option[Param[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  104. def init: This[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  105. def initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
  106. def initializeFrom(in: ObjectInputStream, nodes: This.NodeSetT, edges: This.EdgeSetT): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  107. def inits: Iterator[This[N, E]]
    Definition Classes
    TraversableLike
  108. def intersect(that: GenSet[Param[N, E]]): This[N, E]
    Definition Classes
    GenSetLike
  109. final def isAcyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  110. def isComplete: Boolean
    Definition Classes
    GraphTraversal
  111. def isConnected: Boolean
    Definition Classes
    GraphTraversal
  112. final def isCustomEdgeFilter(f: This.EdgeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  113. final def isCustomNodeFilter(f: This.NodeFilter): Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  114. final def isCyclic: Boolean
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  115. 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
  116. def isDirected: Boolean
    Definition Classes
    GraphLike → GraphBase
  117. final val isDirectedT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  118. final 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
    Param
  119. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  120. def isHyper: Boolean
    Definition Classes
    GraphLike → GraphBase
  121. final val isHyperT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  122. 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
  123. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  124. def isMixed: Boolean
    Definition Classes
    GraphLike → GraphBase
  125. def isMulti: Boolean
    Definition Classes
    GraphLike → GraphBase
  126. final val isMultiT: Boolean
    Attributes
    protected
    Definition Classes
    GraphLike
  127. 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
  128. final 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
    Param
  129. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  130. final def isTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  131. def iterator: Iterator[Param[N, E]]
    Definition Classes
    GraphLike → GenSetLike → IterableLike → GenIterableLike
  132. def last: Param[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  133. def lastOption: Option[Param[N, E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  134. 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.

  135. def max[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def maxBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def maxDegree(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  138. def min[B >: Param[N, E]](implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def minBy[B](f: (Param[N, E]) ⇒ B)(implicit cmp: Ordering[B]): Param[N, E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def minDegree(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  141. def minusMinus(delNodes: Traversable[N], delEdges: Traversable[E[N]]): This[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  142. def minusMinusNodesEdges(delNodes: Traversable[N], delEdges: Traversable[E[N]]): (Set[N], Set[E[N]])
    Attributes
    protected
    Definition Classes
    GraphLike
  143. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. 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
  147. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  148. def newBuilder: Builder[Param[N, E], This[N, E]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  149. final def newEdge(innerEdge: E[This.NodeT]): This.EdgeT
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → GraphBase
  150. final def newEdgeTArray(size: Int): Array[This.EdgeT]
    Attributes
    protected
    Definition Classes
    AdjacencyListGraph → AdjacencyListBase
    Annotations
    @inline()
  151. final def newNode(n: N): This.NodeT
    Attributes
    protected
    Definition Classes
    AdjacencyListBase → GraphBase
    Annotations
    @inline()
  152. final val noNode: This.NodeFilter
    Definition Classes
    GraphBase
  153. def nodesToAdd(passedNodes: Traversable[N], passedEdges: Traversable[E[N]]): Set[N]
    Attributes
    protected
    Definition Classes
    ConstraintMethods
  154. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  155. final def nonTrivial: Boolean
    Definition Classes
    GraphBase
    Annotations
    @inline()
  156. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  157. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  158. 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
  159. 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
  160. def order: Int
    Definition Classes
    GraphBase
  161. def par: ParSet[Param[N, E]]
    Definition Classes
    Parallelizable
  162. def parCombiner: Combiner[Param[N, E], ParSet[Param[N, E]]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  163. final def partition(elems: GenTraversableOnce[Param[N, E]]): Partitions[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike
  164. def partition(p: (Param[N, E]) ⇒ Boolean): (This[N, E], This[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  165. def plusPlus(newNodes: Traversable[N], newEdges: Traversable[E[N]]): This[N, E]
    Attributes
    protected
    Definition Classes
    GraphLike → GraphLike
  166. 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

    passedEdges

    edges passed to the running add operation

    preCheck

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

    Definition Classes
    ConstraintMethods
  167. 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.

    preCheck

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

    Definition Classes
    ConstraintMethods
  168. 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 possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  169. 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 possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  170. 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 possibly any intermediate computation result to be used during the post-check. To add computation results PreCheckResult must be extended.

    Definition Classes
    ConstraintMethods
  171. def product[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  172. def reduce[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  173. def reduceLeft[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): B
    Definition Classes
    TraversableOnce
  174. def reduceLeftOption[B >: Param[N, E]](op: (B, Param[N, E]) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  175. def reduceOption[A1 >: Param[N, E]](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  176. def reduceRight[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  177. def reduceRightOption[B >: Param[N, E]](op: (Param[N, E], B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  178. def repr: This[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  179. def reversed: List[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  180. def sameElements[B >: Param[N, E]](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  181. 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
  182. 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
  183. 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.

  184. final def serializeTo(out: ObjectOutputStream): Unit
    Attributes
    protected
    Definition Classes
    AdjacencyListBase
  185. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  186. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  187. def slice(from: Int, until: Int): This[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  188. def sliding(size: Int, step: Int): Iterator[This[N, E]]
    Definition Classes
    IterableLike
  189. def sliding(size: Int): Iterator[This[N, E]]
    Definition Classes
    IterableLike
  190. def span(p: (Param[N, E]) ⇒ Boolean): (This[N, E], This[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  191. def splitAt(n: Int): (This[N, E], This[N, E])
    Definition Classes
    TraversableLike → GenTraversableLike
  192. def stringPrefix: String
    Definition Classes
    GraphLike → GraphLike → SetLike → TraversableLike → GenTraversableLike
  193. def subsetOf(that: GenSet[Param[N, E]]): Boolean
    Definition Classes
    GenSetLike
  194. def subsets(): Iterator[This[N, E]]
    Definition Classes
    SetLike
  195. def subsets(len: Int): Iterator[This[N, E]]
    Definition Classes
    SetLike
  196. def sum[B >: Param[N, E]](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  197. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  198. def tail: This[N, E]
    Definition Classes
    TraversableLike → GenTraversableLike
  199. def tails: Iterator[This[N, E]]
    Definition Classes
    TraversableLike
  200. def take(n: Int): This[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  201. def takeRight(n: Int): This[N, E]
    Definition Classes
    IterableLike
  202. def takeWhile(p: (Param[N, E]) ⇒ Boolean): This[N, E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  203. def thisCollection: Iterable[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  204. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Param[N, E], Col[Param[N, E]]]): Col[Param[N, E]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  205. def toArray[B >: Param[N, E]](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  206. def toBuffer[A1 >: Param[N, E]]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  207. def toCollection(repr: This[N, E]): Iterable[Param[N, E]]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  208. def toIndexedSeq: IndexedSeq[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  209. def toIterable: Iterable[Param[N, E]]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  210. def toIterator: Iterator[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  211. def toList: List[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  212. def toMap[T, U](implicit ev: <:<[Param[N, E], (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  213. 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
  214. def toSeq: Seq[Param[N, E]]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  215. def toSet[B >: Param[N, E]]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  216. def toSortedString(nodeSeparator: String, edgeSeparator: String, nodesEdgesSeparator: String, withNodesEdgesPrefix: Boolean)(implicit ordNode: This.NodeOrdering, ordEdge: This.EdgeOrdering): String
    Definition Classes
    GraphLike
  217. def toStream: Stream[Param[N, E]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  218. def toString(): String
    Definition Classes
    GraphLike → SetLike → Function1 → TraversableLike → AnyRef → Any
  219. def toTraversable: Traversable[Param[N, E]]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  220. def toVector: Vector[Param[N, E]]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  221. final def topologicalSort[U](implicit visitor: (This.InnerElem) ⇒ U): This.CycleNodeOrTopologicalOrder
    Definition Classes
    GraphTraversal
  222. final def topologicalSortByComponent[U](implicit visitor: (This.InnerElem) ⇒ U): Traversable[This.CycleNodeOrTopologicalOrder]
    Definition Classes
    GraphTraversal
  223. def totalDegree(implicit nodeDegree: This.DegreeFunction, degreeFilter: (Int) ⇒ Boolean): Int
    Definition Classes
    GraphDegree
  224. def totalWeight: Double
    Definition Classes
    GraphBase
  225. def union(that: GenSet[Param[N, E]]): This[N, E]
    Definition Classes
    SetLike → GenSetLike
  226. 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
  227. def view(from: Int, until: Int): IterableView[Param[N, E], This[N, E]]
    Definition Classes
    IterableLike → TraversableLike
  228. def view: IterableView[Param[N, E], This[N, E]]
    Definition Classes
    IterableLike → TraversableLike
  229. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  230. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  231. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  232. def withFilter(p: (Param[N, E]) ⇒ Boolean): FilterMonadic[Param[N, E], This[N, E]]
    Definition Classes
    TraversableLike → FilterMonadic
  233. final def withoutChecks[R](exec: ⇒ R): R
    Attributes
    protected
    Definition Classes
    GraphLike
  234. 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
  235. 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
  236. def zipWithIndex[A1 >: Param[N, E], That](implicit bf: CanBuildFrom[This[N, E], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  237. def |(that: GenSet[Param[N, E]]): This[N, E]
    Definition Classes
    GenSetLike
  238. 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()
  239. 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()
  240. 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
  241. object Edge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  242. object InnerEdge extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  243. object InnerNode extends Serializable
    Definition Classes
    GraphBase
  244. object Node extends Serializable
    Definition Classes
    GraphBase
    Annotations
    @transient()
  245. 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 immutable.AdjacencyListGraph[N, E, This]

Inherited from AdjacencyListBase[N, E, This]

Inherited from GraphLike[N, E, This]

Inherited from Constrained[N, E]

Inherited from ConstraintHandlerMethods[N, E]

Inherited from ConstraintMethods[N, E]

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