Trait/Object

scalax.collection.constrained

Graph

Related Docs: object Graph | package constrained

Permalink

trait Graph[N, E[X] <: EdgeLikeIn[X]] extends Set[Param[N, E]] with collection.Graph[N, E] with GraphLike[N, E, Graph]

A trait for dynamically constrained graphs.

N

the type of the nodes (vertices) in this graph.

E

the kind of the edges in this graph.

Linear Supertypes
GraphLike[N, E, Graph], Constrained[N, E], ConstraintHandlerMethods[N, E], ConstraintMethods[N, E], collection.Graph[N, E], collection.GraphLike[N, E, Graph], GraphDegree[N, E], GraphTraversal[N, E], GraphBase[N, E], Serializable, Serializable, Set[Param[N, E]], SetLike[Param[N, E], Graph[N, E]], Subtractable[Param[N, E], Graph[N, E]], GenSet[Param[N, E]], GenericSetTemplate[Param[N, E], Set], GenSetLike[Param[N, E], Graph[N, E]], Iterable[Param[N, E]], IterableLike[Param[N, E], Graph[N, E]], Equals, GenIterable[Param[N, E]], GenIterableLike[Param[N, E], Graph[N, E]], Traversable[Param[N, E]], GenTraversable[Param[N, E]], GenericTraversableTemplate[Param[N, E], Set], TraversableLike[Param[N, E], Graph[N, E]], GenTraversableLike[Param[N, E], Graph[N, E]], Parallelizable[Param[N, E], ParSet[Param[N, E]]], TraversableOnce[Param[N, E]], GenTraversableOnce[Param[N, E]], FilterMonadic[Param[N, E], Graph[N, E]], HasNewBuilder[Param[N, E], Graph[N, E]], (Param[N, E]) ⇒ Boolean, AnyRef, Any
Known Subclasses
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Graph
  2. GraphLike
  3. Constrained
  4. ConstraintHandlerMethods
  5. ConstraintMethods
  6. Graph
  7. GraphLike
  8. GraphDegree
  9. GraphTraversal
  10. GraphBase
  11. Serializable
  12. Serializable
  13. Set
  14. SetLike
  15. Subtractable
  16. GenSet
  17. GenericSetTemplate
  18. GenSetLike
  19. Iterable
  20. IterableLike
  21. Equals
  22. GenIterable
  23. GenIterableLike
  24. Traversable
  25. GenTraversable
  26. GenericTraversableTemplate
  27. TraversableLike
  28. GenTraversableLike
  29. Parallelizable
  30. TraversableOnce
  31. GenTraversableOnce
  32. FilterMonadic
  33. HasNewBuilder
  34. Function1
  35. AnyRef
  36. Any
Implicitly
  1. by anyToNode
  2. by MonadOps
  3. by CollectionsHaveToParArray
  4. by EdgeAssoc
  5. by predicateToNodePredicate
  6. by any2stringadd
  7. by StringFormat
  8. by Ensuring
  9. by ArrowAssoc
  10. by alternateImplicit
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Type Members

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

    Permalink
    Definition Classes
    GraphTraversal
  2. abstract class Component extends Properties

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphDegree
  10. trait Edge extends Serializable

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

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

    Permalink
    Definition Classes
    GraphBase
  13. sealed trait EdgeOrdering extends Ordering[EdgeT] with ElemOrdering

    Permalink
    Definition Classes
    GraphBase
  14. trait EdgeSet extends GraphLike.This.EdgeSet

    Permalink
    Definition Classes
    GraphLike
  15. abstract type EdgeSetT <: EdgeSet

    Permalink
    Definition Classes
    GraphLike → GraphBase
  16. abstract type EdgeT <: InnerEdgeParam[N, E, NodeT, E] with InnerEdge with Serializable

    Permalink
    Definition Classes
    GraphBase
  17. sealed trait ElemOrdering extends AnyRef

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

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

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
  23. sealed trait InnerElem extends AnyRef

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  25. trait InnerNode extends GraphLike.This.InnerNode with GraphLike.This.TraverserInnerNode

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

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

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
  31. trait Node extends Serializable

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

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

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

    Permalink
    Definition Classes
    GraphBase
  35. trait NodeSet extends GraphLike.This.NodeSet

    Permalink
    Definition Classes
    GraphLike
  36. abstract type NodeSetT <: NodeSet

    Permalink
    Definition Classes
    GraphLike → GraphBase
  37. abstract type NodeT <: InnerNode

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

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
  42. trait Path extends Walk

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

    Permalink
    Definition Classes
    GraphTraversal
  44. trait Properties extends SubgraphProperties

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  45. type Self = Graph[N, E]

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphTraversal
  47. type ThisGraph = Graph.this.type

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
  54. class Weight extends AnyRef

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

    Permalink
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def +(node: N): Graph[N, E]

    Permalink
    Definition Classes
    GraphLike
  2. abstract def +#(edge: E[N]): Graph[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  3. abstract def -(node: N): Graph[N, E]

    Permalink
    Definition Classes
    GraphLike
  4. abstract def -!#(edge: E[N]): Graph[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  5. abstract def -#(edge: E[N]): Graph[N, E]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  6. abstract def -?(node: N): Graph[N, E]

    Permalink
    Definition Classes
    GraphLike
  7. abstract def componentTraverser(parameters: Parameters, subgraphNodes: NodeFilter, subgraphEdges: EdgeFilter, ordering: ElemOrdering, maxWeight: Option[Weight]): ComponentTraverser

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

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

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

    Permalink
    Definition Classes
    GraphLike
  11. abstract def edges: EdgeSetT

    Permalink
    Definition Classes
    GraphBase
  12. abstract val graphCompanion: GraphConstrainedCompanion[Graph]

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

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
  17. abstract def newEdge(innerEdge: E[NodeT]): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase
  18. abstract def newNode(n: N): NodeT

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

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

    Permalink
    Definition Classes
    GraphTraversal
  21. abstract def nodes: NodeSetT

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

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

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

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

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

    Permalink

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

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

    edge

    to be added.

    returns

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

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

    Permalink

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

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

    node

    to be added

    returns

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

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

    Permalink

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

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

    edge

    the inner edge to be subtracted.

    simple

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

    returns

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

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

    Permalink

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

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

    node

    the inner to be subtracted.

    forced

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

    returns

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

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

    Permalink

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

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

    Definition Classes
    ConstraintMethods

Concrete Value Members

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

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

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

    Permalink
    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[Param[N, E]]): Graph[N, E]

    Permalink
    Definition Classes
    GenSetLike
  5. def +(elem: Param[N, E]): Graph[N, E]

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

    Permalink
    Definition Classes
    SetLike
  7. def ++(elems: GenTraversableOnce[Param[N, E]]): Graph.this.type

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

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

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

    Permalink
    Definition Classes
    TraversableLike
  11. def -(elem: Param[N, E]): Graph[N, E]

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

    Permalink
    Definition Classes
    Subtractable
  13. def -!(elem: Param[N, E]): Graph[N, E]

    Permalink
    Definition Classes
    GraphLike
  14. def --(elems: GenTraversableOnce[Param[N, E]]): Graph[N, E]

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

    Permalink
    Definition Classes
    GraphLike
  16. def ->[B](y: B): (Graph[N, E], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from Graph[N, E] to ArrowAssoc[Graph[N, E]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  17. def /:[B](z: B)(op: (B, Param[N, E]) ⇒ B): B

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

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

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

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

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

    Permalink
    Definition Classes
    GraphBase
  23. object Node extends Serializable

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

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @transient()
  25. def addString(b: StringBuilder): StringBuilder

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

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

    Permalink
    Definition Classes
    TraversableOnce
  28. def aggregate[B](z: ⇒ B)(seqop: (B, Param[N, E]) ⇒ B, combop: (B, B) ⇒ B): B

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

    Permalink

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

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

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

    Permalink

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink

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

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

    Attributes
    protected
    Definition Classes
    GraphLike
  42. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  43. def collect[B, That](pf: PartialFunction[Param[N, E], B])(implicit bf: CanBuildFrom[Graph[N, E], B, That]): That

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

    Permalink
    Definition Classes
    TraversableOnce
  45. def companion: GenericCompanion[Set]

    Permalink
    Definition Classes
    Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  46. def compose[A](g: (A) ⇒ Param[N, E]): (A) ⇒ Boolean

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphBase
  54. final lazy val defaultNodeOrdering: NodeOrdering

    Permalink
    Definition Classes
    GraphBase
  55. final def defaultPathSize: Int

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  65. implicit final def edgeToEdgeCont(e: E[N]): E[NodeT]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase
    Annotations
    @inline()
  66. def empty: Graph[N, E]

    Permalink
    Definition Classes
    Graph → Graph → SetLike → GenericSetTemplate
  67. def ensuring(cond: (Graph[N, E]) ⇒ Boolean, msg: ⇒ Any): Graph[N, E]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  82. def flatten[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  83. def fold[A1 >: Param[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1

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

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

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

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

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from Graph[N, E] to StringFormat[Graph[N, E]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  89. def genericBuilder[B]: Builder[B, Set[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  90. final def get(outerEdge: E[N]): EdgeT

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike
  98. def hasDefiniteSize: Boolean

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  103. def init: Graph[N, E]

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphBase
  105. def inits: Iterator[Graph[N, E]]

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

    Permalink
    Definition Classes
    GenSetLike
  107. final def isAcyclic: Boolean

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

    Permalink
    Definition Classes
    GraphTraversal
  109. def isConnected: Boolean

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    Any
  122. def isMulti: Boolean

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike → FilterMonadic
    Annotations
    @migration
    Migration

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. val n1: Graph[N, E]

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

    Permalink
    Definition Classes
    AnyRef
  145. def newBuilder: Builder[Param[N, E], Graph[N, E]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  146. final val noNode: NodeFilter

    Permalink
    Definition Classes
    GraphBase
  147. def nonEmpty: Boolean

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

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

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

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

    Permalink

    This handler is called whenever an addition violates the constraints.

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

    refusedNodes

    the nodes passed to preAdd.

    refusedEdges

    the edges passed to preAdd.

    returns

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

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

    Permalink

    This handler is called whenever a subtraction violates the constraints.

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

    refusedNodes

    the nodes passed to preSubtract.

    refusedEdges

    the edges passed to preSubtract.

    returns

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

    Definition Classes
    ConstraintHandlerMethods
  153. def order: Int

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

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

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

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

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

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

    Permalink

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

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

    newGraph

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

    passedNodes

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

    passedEdges

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

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

    Permalink

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

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

    newGraph

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

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

    Permalink

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

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

    elems

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

    returns

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

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

    Permalink

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

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

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

    nodes

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

    edges

    the outer edges the graph is to be populated with.

    returns

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

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

    Permalink

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

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

    nodes

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

    edges

    the inner edges to be subtracted.

    simple

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

    returns

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  171. def repr: Graph[N, E]

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

  177. def seq: Set[Param[N, E]]

    Permalink
    Definition Classes
    Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  178. def size: Int

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
  190. def tail: Graph[N, E]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphDegree
  216. def totalWeight: Long

    Permalink
    Definition Classes
    GraphBase
  217. def transpose[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[Set[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  218. def union(that: GenSet[Param[N, E]]): Graph[N, E]

    Permalink
    Definition Classes
    SetLike → GenSetLike
  219. def unzip[A1, A2](implicit asPair: (Param[N, E]) ⇒ (A1, A2)): (Set[A1], Set[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  220. def unzip3[A1, A2, A3](implicit asTriple: (Param[N, E]) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  221. val value: Graph[N, E]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Shadowed Implicit Value Members

  1. def +(other: String): String

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

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

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

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from Graph[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (graph: MonadOps[Param[N, E]]).filter(p)
    Definition Classes
    MonadOps
  6. def flatMap[B](f: (Param[N, E]) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Graph[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (graph: MonadOps[Param[N, E]]).flatMap(f)
    Definition Classes
    MonadOps
  7. def map[B](f: (Param[N, E]) ⇒ B): TraversableOnce[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Graph[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (graph: MonadOps[Param[N, E]]).map(f)
    Definition Classes
    MonadOps
  8. def stringPrefix: String

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

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

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from Graph[N, E] to MonadOps[Param[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (graph: MonadOps[Param[N, E]]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from GraphLike[N, E, Graph]

Inherited from Constrained[N, E]

Inherited from ConstraintHandlerMethods[N, E]

Inherited from ConstraintMethods[N, E]

Inherited from collection.Graph[N, E]

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

Inherited from GraphDegree[N, E]

Inherited from GraphTraversal[N, E]

Inherited from GraphBase[N, E]

Inherited from Serializable

Inherited from Serializable

Inherited from Set[Param[N, E]]

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

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

Inherited from GenSet[Param[N, E]]

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

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

Inherited from Iterable[Param[N, E]]

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

Inherited from Equals

Inherited from GenIterable[Param[N, E]]

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

Inherited from Traversable[Param[N, E]]

Inherited from GenTraversable[Param[N, E]]

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

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

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

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

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

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

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

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

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

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

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

Ungrouped