Trait/Object

scalax.collection.constrained.mutable

Graph

Related Docs: object Graph | package mutable

Permalink

trait Graph[N, E[X] <: EdgeLikeIn[X]] extends mutable.Graph[N, E] with constrained.Graph[N, E] with GraphLike[N, E, Graph]

Linear Supertypes
GraphLike[N, E, Graph], constrained.Graph[N, E], constrained.GraphLike[N, E, Graph], Constrained[N, E], ConstraintHandlerMethods[N, E], ConstraintMethods[N, E], mutable.Graph[N, E], mutable.GraphLike[N, E, Graph], Mutable, EdgeOps[N, E, Graph], Cloneable[Graph[N, E]], Cloneable, Cloneable, Shrinkable[Param[N, E]], Growable[Param[N, E]], Clearable, 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. Graph
  4. GraphLike
  5. Constrained
  6. ConstraintHandlerMethods
  7. ConstraintMethods
  8. Graph
  9. GraphLike
  10. Mutable
  11. EdgeOps
  12. Cloneable
  13. Cloneable
  14. Cloneable
  15. Shrinkable
  16. Growable
  17. Clearable
  18. Graph
  19. GraphLike
  20. GraphDegree
  21. GraphTraversal
  22. GraphBase
  23. Serializable
  24. Serializable
  25. Set
  26. SetLike
  27. Subtractable
  28. GenSet
  29. GenericSetTemplate
  30. GenSetLike
  31. Iterable
  32. IterableLike
  33. Equals
  34. GenIterable
  35. GenIterableLike
  36. Traversable
  37. GenTraversable
  38. GenericTraversableTemplate
  39. TraversableLike
  40. GenTraversableLike
  41. Parallelizable
  42. TraversableOnce
  43. GenTraversableOnce
  44. FilterMonadic
  45. HasNewBuilder
  46. Function1
  47. AnyRef
  48. 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 Set[mutable.GraphLike.This.EdgeT] with mutable.GraphLike.This.EdgeSet

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

    Permalink
    Definition Classes
    GraphLike → 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 mutable.GraphLike.This.InnerNode with mutable.GraphLike.This.InnerNodeOps

    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. trait InnerNodeOps extends AnyRef

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

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
  32. trait Node extends Serializable

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

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

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

    Permalink
    Definition Classes
    GraphBase
  36. trait NodeSet extends This.NodeSet

    Permalink
    Definition Classes
    GraphLike
  37. abstract type NodeSetT <: Graph.NodeSet

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

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

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
  43. trait Path extends Walk

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

    Permalink
    Definition Classes
    GraphTraversal
  45. trait Properties extends SubgraphProperties

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
  55. class Weight extends AnyRef

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

    Permalink
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def +=#(edge: E[N]): Graph.this.type

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  2. abstract def add(edge: E[N]): Boolean

    Permalink
    Definition Classes
    GraphLike
  3. abstract def add(node: N): Boolean

    Permalink
    Definition Classes
    GraphLike
  4. abstract def clear(): Unit

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

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

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

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

    Permalink
    Definition Classes
    GraphLike
  9. abstract def edges: EdgeSetT

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
  19. abstract def nodes: NodeSetT

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

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
  24. 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
  25. 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
  26. abstract def preSubtract(edge: Graph.EdgeT, simple: Boolean): PreCheckResult

    Permalink

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

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

    edge

    the inner edge to be subtracted.

    simple

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

    returns

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

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

    Permalink

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

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

    node

    the inner to be subtracted.

    forced

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

    returns

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

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

    Permalink

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

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

    Definition Classes
    ConstraintMethods
  29. abstract def upsert(edge: E[N]): Boolean

    Permalink
    Definition Classes
    GraphLike

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 &=(coll: Iterable[Param[N, E]]): Graph.this.type

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    Growable
  18. final def +~%+=[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(weight: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind): Graph.this.type

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

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

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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  22. final def +~+=[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): Graph.this.type

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  23. final def +~+=[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): Graph.this.type

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
    Annotations
    @inline()
  44. 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()
  45. final def -?(node: N): Graph[N, E]

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphBase
  53. object Node extends Serializable

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

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @transient()
  55. final def addAndGet(edge: E[N]): EdgeT

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

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

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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  59. def addAndGetLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): EdgeT

    Permalink
    Definition Classes
    EdgeOps
  60. final def addAndGetLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): EdgeT

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

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

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

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

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

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

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  67. final def addLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](node_1: N, node_2: N, nodes: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): Boolean

    Permalink
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  68. final def addLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](node_1: N, node_2: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): Boolean

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

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

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

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

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

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

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

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

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

    Permalink

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

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

    Attributes
    protected
    Definition Classes
    ConstraintMethods
  78. 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
  79. def andThen[A](g: (Boolean) ⇒ A): (Param[N, E]) ⇒ A

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → Equals
  89. 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
  90. def checkedAdd[G >: Graph[N, E]](contained: ⇒ Boolean, preAdd: ⇒ PreCheckResult, copy: ⇒ G, nodes: ⇒ Traversable[N], edges: ⇒ Traversable[E[N]]): Graph[N, E]

    Permalink

    generic checked addition

    generic checked addition

    Attributes
    protected
    Definition Classes
    GraphLike
  91. def clone(): Graph[N, E]

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphBase
  104. final def defaultPathSize: Int

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphGraph → Graph → Graph → SetLike → GenericSetTemplate
  116. 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
  117. 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
  118. 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
  119. 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
  120. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
  130. 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
  131. def flatten[B](implicit asTraversable: (Param[N, E]) ⇒ GenTraversableOnce[B]): Set[B]

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  137. 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()
  138. def genericBuilder[B]: Builder[B, Set[B]]

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike
  147. def hasDefiniteSize: Boolean

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GenSetLike
  156. final def isAcyclic: Boolean

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

    Permalink
    Definition Classes
    GraphTraversal
  158. def isConnected: Boolean

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

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

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

    Permalink
    Definition Classes
    GraphTraversal
    Annotations
    @inline()
  162. 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
  163. def isDirected: Boolean

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  165. 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
  166. def isEmpty: Boolean

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

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  169. 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
  170. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  171. def isMulti: Boolean

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  173. 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
  174. 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
  175. final def isTraversableAgain: Boolean

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  180. 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.

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  192. 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
  193. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    GraphBase
  196. def nodesToCEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with CHyperEdgeBound[_, EE]](factory: CHyperEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]

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

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

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

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

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

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  202. final def nodesToLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](edgeFactory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  203. final def nodesToLEdge[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](edgeFactory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): EdgeT

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeOps
    Annotations
    @inline()
  204. def nodesToLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](factory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): E[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeOps
  205. def nodesToLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](factory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*)(implicit kind: CollectionKind): E[NodeT]

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink

    This handler is called whenever an addition violates the constraints.

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

    refusedNodes

    the nodes passed to preAdd.

    refusedEdges

    the edges passed to preAdd.

    returns

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

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

    Permalink

    This handler is called whenever a subtraction violates the constraints.

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

    refusedNodes

    the nodes passed to preSubtract.

    refusedEdges

    the edges passed to preSubtract.

    returns

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

    Definition Classes
    ConstraintHandlerMethods
  220. def order: Int

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

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

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

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

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

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

    Permalink

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

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

    newGraph

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

    passedNodes

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

    passedEdges

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

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

    Permalink

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

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

    newGraph

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

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

    Permalink

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

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

    nodes

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

    edges

    the inner edges to be subtracted.

    simple

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

    returns

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  245. 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
  246. 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
  247. 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  276. 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
  277. def toSeq: Seq[Param[N, E]]

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GraphDegree
  287. def totalWeight: Long

    Permalink
    Definition Classes
    GraphBase
  288. 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.

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

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

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

    Permalink
    Definition Classes
    GenericTraversableTemplate
  292. 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
  293. def view(from: Int, until: Int): IterableView[Param[N, E], Graph[N, E]]

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

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

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

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

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

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

    Permalink
    Attributes
    protected
    Definition Classes
    GraphLike
  300. 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
  301. 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
  302. def zipWithIndex[A1 >: Param[N, E], That](implicit bf: CanBuildFrom[Graph[N, E], (A1, Int), That]): That

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

    Permalink
    Definition Classes
    GenSetLike
  304. 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()
  305. 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()
  306. 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.Graph[N, E]

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

Inherited from Constrained[N, E]

Inherited from ConstraintHandlerMethods[N, E]

Inherited from ConstraintMethods[N, E]

Inherited from mutable.Graph[N, E]

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

Inherited from Mutable

Inherited from EdgeOps[N, E, Graph]

Inherited from Cloneable[Graph[N, E]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[Param[N, E]]

Inherited from Growable[Param[N, E]]

Inherited from Clearable

Inherited from collection.Graph[N, E]

Inherited from collection.GraphLike[N, E, 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