Packages

trait NodeSet extends Set[(GraphLike.this)#NodeT] with (GraphLike.this)#NodeSet

Linear Supertypes
(GraphLike.this)#NodeSet, (GraphLike.this)#NodeSet, ExtSetMethods[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT], SetLike[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]], Cloneable[Set[(GraphLike.this)#NodeT]], Cloneable, Cloneable, Shrinkable[(GraphLike.this)#NodeT], Builder[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]], Growable[(GraphLike.this)#NodeT], Clearable, Scriptable[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT], SetLike[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]], Subtractable[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]], GenSet[(GraphLike.this)#NodeT], GenericSetTemplate[(GraphLike.this)#NodeT, Set], GenSetLike[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]], ((GraphLike.this)#NodeT) ⇒ Boolean, Iterable[(GraphLike.this)#NodeT], Iterable[(GraphLike.this)#NodeT], IterableLike[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]], Equals, GenIterable[(GraphLike.this)#NodeT], GenIterableLike[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]], Traversable[(GraphLike.this)#NodeT], Mutable, Traversable[(GraphLike.this)#NodeT], GenTraversable[(GraphLike.this)#NodeT], GenericTraversableTemplate[(GraphLike.this)#NodeT, Set], TraversableLike[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]], GenTraversableLike[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]], Parallelizable[(GraphLike.this)#NodeT, ParSet[(GraphLike.this)#NodeT]], TraversableOnce[(GraphLike.this)#NodeT], GenTraversableOnce[(GraphLike.this)#NodeT], FilterMonadic[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]], HasNewBuilder[(GraphLike.this)#NodeT, scala.collection.mutable.Set[GraphLike.this.NodeT] @scala.annotation.unchecked.uncheckedVariance], AnyRef, Any
Known Subclasses
NodeSet
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeSet
  2. NodeSet
  3. NodeSet
  4. ExtSetMethods
  5. Set
  6. SetLike
  7. Cloneable
  8. Cloneable
  9. Cloneable
  10. Shrinkable
  11. Builder
  12. Growable
  13. Clearable
  14. Scriptable
  15. Set
  16. SetLike
  17. Subtractable
  18. GenSet
  19. GenericSetTemplate
  20. GenSetLike
  21. Function1
  22. Iterable
  23. Iterable
  24. IterableLike
  25. Equals
  26. GenIterable
  27. GenIterableLike
  28. Traversable
  29. Mutable
  30. Traversable
  31. GenTraversable
  32. GenericTraversableTemplate
  33. TraversableLike
  34. GenTraversableLike
  35. Parallelizable
  36. TraversableOnce
  37. GenTraversableOnce
  38. FilterMonadic
  39. HasNewBuilder
  40. AnyRef
  41. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by flattenTraversableOnce
  5. by EdgeAssoc
  6. by predicateToNodePredicate
  7. by graphParamsToPartition
  8. by any2stringadd
  9. by StringFormat
  10. by Ensuring
  11. by ArrowAssoc
  12. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Self = Set[(GraphLike.this)#NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def +=(elem: (GraphLike.this)#NodeT): NodeSet.this.type
    Definition Classes
    SetLike → Builder → Growable
  2. abstract def contains(elem: (GraphLike.this)#NodeT): Boolean
    Definition Classes
    SetLike → GenSetLike
  3. abstract def copy: (GraphLike.this)#NodeSetT
    Attributes
    protected
    Definition Classes
    NodeSet
  4. abstract def draw(random: Random): (GraphLike.this)#NodeT

    Returns a random element of the set if it is nonEmpty otherwise throws IllegalArgumentException.

    Returns a random element of the set if it is nonEmpty otherwise throws IllegalArgumentException.

    random

    a random generator; it is essential that random be instantiated by the caller just once for any sequence of calls

    Definition Classes
    NodeSet → ExtSetMethods
  5. abstract def find(outerNode: N): Option[(GraphLike.this)#NodeT]

    Finds the inner node corresponding to outerNode.

    Finds the inner node corresponding to outerNode.

    returns

    the inner node wrapped by Some if found, otherwise None.

    Definition Classes
    NodeSet
  6. abstract def findElem[B](toMatch: B, correspond: ((GraphLike.this)#NodeT, B) ⇒ Boolean): (GraphLike.this)#NodeT

    Finds an entry in the collection based on toMatch's hashCode and a correspondence function but not on the argument type.

    Finds an entry in the collection based on toMatch's hashCode and a correspondence function but not on the argument type.

    toMatch

    a value not necessarily of type A; the entry to be searched for must have the same hashCode and be equal to this argument

    correspond

    function returning whether a given entry corresponds to other

    returns

    the entry corresponding to toMatch or null if not contained

    Definition Classes
    ExtSetMethods
  7. abstract def get(outerNode: N): (GraphLike.this)#NodeT

    Finds the inner node corresponding to outerNode.

    Finds the inner node corresponding to outerNode.

    returns

    the inner node if found, otherwise NoSuchElementException is thrown.

    Definition Classes
    NodeSet
  8. abstract def initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit

    This method is called by the primary constructor.

    This method is called by the primary constructor. It must be defined by the trait responsible for the implementation of the graph representation.

    nodes

    The isolated (and optionally any other) outer nodes that the node set of this graph is to be populated with.

    edges

    The outer edges that the edge set of this graph is to be populated with. Nodes being the end of any of these edges will be added to the node set.

    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet
  9. abstract def iterator: Iterator[(GraphLike.this)#NodeT]
    Definition Classes
    GenSetLike → GenIterableLike
  10. abstract def lookup(outerNode: N): (GraphLike.this)#NodeT

    Finds the inner node corresponding to outerNode.

    Finds the inner node corresponding to outerNode.

    returns

    the inner node if found, otherwise null.

    Definition Classes
    NodeSet
  11. abstract def minus(node: (GraphLike.this)#NodeT): Unit

    removes node from this node set leaving the edge set unchanged.

    removes node from this node set leaving the edge set unchanged.

    node

    the node to be removed from the node set.

    Attributes
    protected
    Definition Classes
    NodeSet
  12. abstract def minusEdges(node: (GraphLike.this)#NodeT): Unit

    removes all incident edges of node from the edge set leaving the node set unchanged.

    removes all incident edges of node from the edge set leaving the node set unchanged.

    node

    the node the incident edges of which are to be removed from the edge set.

    Attributes
    protected

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    GenSetLike
  5. def +(elem1: (GraphLike.this)#NodeT, elem2: (GraphLike.this)#NodeT, elems: (GraphLike.this)#NodeT*): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → SetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.

  6. def +(elem: (GraphLike.this)#NodeT): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → SetLike → GenSetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.

  7. def ++(xs: GenTraversableOnce[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → SetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) ++ creates a new set. Use ++= to add elements to this set and return that set itself.

  8. def ++[B >: (GraphLike.this)#NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  9. def ++:[B >: (GraphLike.this)#NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike
  10. def ++:[B >: (GraphLike.this)#NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike
  11. def ++=(xs: TraversableOnce[(GraphLike.this)#NodeT]): NodeSet.this.type
    Definition Classes
    Growable
  12. def +=(elem1: (GraphLike.this)#NodeT, elem2: (GraphLike.this)#NodeT, elems: (GraphLike.this)#NodeT*): NodeSet.this.type
    Definition Classes
    Growable
  13. final def -(node: (GraphLike.this)#NodeT): (GraphLike.this)#NodeSetT
    Definition Classes
    NodeSet → SetLike → Subtractable → GenSetLike
  14. def -(elem1: (GraphLike.this)#NodeT, elem2: (GraphLike.this)#NodeT, elems: (GraphLike.this)#NodeT*): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new set. Use -= to remove an element from this set and return that set itself.

  15. def --(xs: GenTraversableOnce[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) -- creates a new set. Use --= to remove elements from this set and return that set itself.

  16. def --=(xs: TraversableOnce[(GraphLike.this)#NodeT]): NodeSet.this.type
    Definition Classes
    Shrinkable
  17. final def -=(node: (GraphLike.this)#NodeT): NodeSet.this.type
    Definition Classes
    NodeSet → SetLike → Shrinkable
    Annotations
    @inline()
  18. def -=(elem1: (GraphLike.this)#NodeT, elem2: (GraphLike.this)#NodeT, elems: (GraphLike.this)#NodeT*): NodeSet.this.type
    Definition Classes
    Shrinkable
  19. def ->[B](y: B): ((GraphLike.this)#NodeSet, B)
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to ArrowAssoc[(GraphLike.this)#NodeSet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  20. final def -?(node: (GraphLike.this)#NodeT): (GraphLike.this)#NodeSetT
    Annotations
    @inline()
  21. final def -?=(node: (GraphLike.this)#NodeT): NodeSet.this.type
    Annotations
    @inline()
  22. def /:[B](z: B)(op: (B, (GraphLike.this)#NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. def :\[B](z: B)(op: ((GraphLike.this)#NodeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  24. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  25. def add(elem: (GraphLike.this)#NodeT): Boolean
    Definition Classes
    SetLike
  26. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  27. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  28. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  29. def adjacencyListsToString: String
    Definition Classes
    NodeSet
  30. def aggregate[B](z: ⇒ B)(seqop: (B, (GraphLike.this)#NodeT) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  31. def andThen[A](g: (Boolean) ⇒ A): ((GraphLike.this)#NodeT) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  32. def apply(elem: (GraphLike.this)#NodeT): Boolean
    Definition Classes
    GenSetLike → Function1
  33. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  34. def asSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: (GraphLike.this)#NodeOrdering = defaultNodeOrdering): String

    Sorts all nodes according to ord and concatenates them using separator.

    Sorts all nodes according to ord and concatenates them using separator.

    separator

    to separate nodes by.

    ord

    custom ordering.

    returns

    sorted and concatenated string representation of this node set.

    Definition Classes
    NodeSet
  35. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  36. def clear(): Unit
    Definition Classes
    SetLike → Builder → Growable → Clearable
  37. def clone(): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → Cloneable → AnyRef
  38. def collect[B, That](pf: PartialFunction[(GraphLike.this)#NodeT, B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  39. def collectFirst[B](pf: PartialFunction[(GraphLike.this)#NodeT, B]): Option[B]
    Definition Classes
    TraversableOnce
  40. def companion: GenericCompanion[Set]
    Definition Classes
    Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  41. def compose[A](g: (A) ⇒ (GraphLike.this)#NodeT): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  42. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  43. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def copyToBuffer[B >: (GraphLike.this)#NodeT](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  46. def count(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  47. def diff(that: GenSet[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → GenSetLike
  48. def drop(n: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  49. def dropRight(n: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike
  50. def dropWhile(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Set[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  51. def edgeParams: Traversable[EdgeParam]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  52. val elems: Traversable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  53. def empty: Set[(GraphLike.this)#NodeT]
    Definition Classes
    GenericSetTemplate
  54. def ensuring(cond: ((GraphLike.this)#NodeSet) ⇒ Boolean, msg: ⇒ Any): (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to Ensuring[(GraphLike.this)#NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  55. def ensuring(cond: ((GraphLike.this)#NodeSet) ⇒ Boolean): (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to Ensuring[(GraphLike.this)#NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  56. def ensuring(cond: Boolean, msg: ⇒ Any): (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to Ensuring[(GraphLike.this)#NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  57. def ensuring(cond: Boolean): (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to Ensuring[(GraphLike.this)#NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  58. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  59. def equals(that: Any): Boolean
    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  60. def exists(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  61. def filter(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Set[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  62. def filterNot(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Set[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  63. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  64. def find(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  65. def flatMap[B, That](f: ((GraphLike.this)#NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  66. def flatten[B](implicit asTraversable: ((GraphLike.this)#NodeT) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  67. def fold[A1 >: (GraphLike.this)#NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. def foldLeft[B](z: B)(op: (B, (GraphLike.this)#NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. def foldRight[B](z: B)(op: ((GraphLike.this)#NodeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  70. def forall(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  71. def foreach[U](f: ((GraphLike.this)#NodeT) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  72. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to StringFormat[(GraphLike.this)#NodeSet] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  73. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  74. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  75. def groupBy[K](f: ((GraphLike.this)#NodeT) ⇒ K): Map[K, Set[(GraphLike.this)#NodeT]]
    Definition Classes
    TraversableLike → GenTraversableLike
  76. def grouped(size: Int): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableLike
  77. def handleNotGentlyRemovable: Boolean
    Attributes
    protected
    Definition Classes
    NodeSet
  78. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  79. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  80. def head: (GraphLike.this)#NodeT
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  81. def headOption: Option[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  82. def init: Set[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  83. def inits: Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    TraversableLike
  84. def intersect(that: GenSet[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    GenSetLike
  85. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to OuterNode[(GraphLike.this)#NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  86. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to OuterNode[(GraphLike.this)#NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  87. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  88. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to OuterNode[(GraphLike.this)#NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  89. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  90. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to OuterNode[(GraphLike.this)#NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  91. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to OuterNode[(GraphLike.this)#NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  92. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  93. def last: (GraphLike.this)#NodeT
    Definition Classes
    TraversableLike → GenTraversableLike
  94. def lastOption: Option[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  95. def map[B, That](f: ((GraphLike.this)#NodeT) ⇒ B)(implicit bf: CanBuildFrom[Set[(GraphLike.this)#NodeT], B, That]): That
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike → FilterMonadic
    Annotations
    @migration
    Migration

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

  96. def mapResult[NewTo](f: (Set[(GraphLike.this)#NodeT]) ⇒ NewTo): Builder[(GraphLike.this)#NodeT, NewTo]
    Definition Classes
    Builder
  97. def max[B >: (GraphLike.this)#NodeT](implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def maxBy[B](f: ((GraphLike.this)#NodeT) ⇒ B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def min[B >: (GraphLike.this)#NodeT](implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def minBy[B](f: ((GraphLike.this)#NodeT) ⇒ B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. val n1: (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to EdgeAssoc[(GraphLike.this)#NodeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  105. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  106. def newBuilder: Builder[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → HasNewBuilder
  107. def nodeParams: Traversable[NodeParam[N]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  108. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  110. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  111. def par: ParSet[(GraphLike.this)#NodeT]
    Definition Classes
    Parallelizable
  112. def parCombiner: Combiner[(GraphLike.this)#NodeT, ParSet[(GraphLike.this)#NodeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → Parallelizable
  113. def partition(p: ((GraphLike.this)#NodeT) ⇒ Boolean): (Set[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  114. lazy val partitioned: (Traversable[Param[N, E]], Traversable[Param[N, E]])
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  115. def product[B >: (GraphLike.this)#NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def reduce[A1 >: (GraphLike.this)#NodeT](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def reduceLeft[B >: (GraphLike.this)#NodeT](op: (B, (GraphLike.this)#NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce
  118. def reduceLeftOption[B >: (GraphLike.this)#NodeT](op: (B, (GraphLike.this)#NodeT) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def reduceOption[A1 >: (GraphLike.this)#NodeT](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def reduceRight[B >: (GraphLike.this)#NodeT](op: ((GraphLike.this)#NodeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  121. def reduceRightOption[B >: (GraphLike.this)#NodeT](op: ((GraphLike.this)#NodeT, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. def remove(node: (GraphLike.this)#NodeT): Boolean
    Definition Classes
    NodeSet → SetLike
  123. def removeGently(node: (GraphLike.this)#NodeT): Boolean
  124. def repr: Set[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  125. def result(): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → Builder
  126. def retain(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Unit
    Definition Classes
    SetLike
  127. def reversed: List[(GraphLike.this)#NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  128. def sameElements[B >: (GraphLike.this)#NodeT](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  129. def scan[B >: (GraphLike.this)#NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[(GraphLike.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  130. def scanLeft[B, That](z: B)(op: (B, (GraphLike.this)#NodeT) ⇒ B)(implicit bf: CanBuildFrom[Set[(GraphLike.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  131. def scanRight[B, That](z: B)(op: ((GraphLike.this)#NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Set[(GraphLike.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

  132. def seq: Set[(GraphLike.this)#NodeT]
    Definition Classes
    Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  133. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  135. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  136. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  137. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  138. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  139. def slice(from: Int, until: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  140. def sliding(size: Int, step: Int): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableLike
  141. def sliding(size: Int): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableLike
  142. def span(p: ((GraphLike.this)#NodeT) ⇒ Boolean): (Set[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  143. def splitAt(n: Int): (Set[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  144. def stringPrefix: String
    Definition Classes
    NodeSet → SetLike → TraversableLike → GenTraversableLike
  145. def subsetOf(that: GenSet[(GraphLike.this)#NodeT]): Boolean
    Definition Classes
    GenSetLike
  146. def subsets(): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    SetLike
  147. def subsets(len: Int): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    SetLike
  148. final def subtract(node: (GraphLike.this)#NodeT, rippleDelete: Boolean, minusNode: ((GraphLike.this)#NodeT) ⇒ Unit, minusEdges: ((GraphLike.this)#NodeT) ⇒ Unit): Boolean

    removes node either rippling or gently.

    removes node either rippling or gently.

    node

    the node to be subtracted

    rippleDelete

    if true, node will be deleted with its incident edges; otherwise node will be only deleted if it has no incident edges or all its incident edges are hooks.

    minusNode

    implementation of node removal without considering incident edges.

    minusEdges

    implementation of removal of all incident edges.

    returns

    true if node has been removed.

    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet
  149. def sum[B >: (GraphLike.this)#NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  150. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  151. def tail: Set[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  152. def tails: Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    TraversableLike
  153. def take(n: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  154. def takeRight(n: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike
  155. def takeWhile(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  156. def thisCollection: Iterable[(GraphLike.this)#NodeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  157. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (GraphLike.this)#NodeT, Col[(GraphLike.this)#NodeT]]): Col[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  158. def toArray[B >: (GraphLike.this)#NodeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  159. def toBuffer[A1 >: (GraphLike.this)#NodeT]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  160. def toCollection(repr: Set[(GraphLike.this)#NodeT]): Iterable[(GraphLike.this)#NodeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  161. def toInParams: Traversable[InParam[N, E]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  162. def toIndexedSeq: IndexedSeq[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  163. def toIterable: Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  164. def toIterator: Iterator[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  165. def toList: List[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  166. def toMap[T, U](implicit ev: <:<[(GraphLike.this)#NodeT, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  167. def toOuter: Set[N]

    Converts this node set to a set of outer nodes.

    Converts this node set to a set of outer nodes.

    Definition Classes
    NodeSet
  168. def toOuterEdges: Traversable[E[N]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  169. def toOuterNodes: Traversable[N]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  170. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to CollectionsHaveToParArray[(GraphLike.this)#NodeSet, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type ((GraphLike.this)#NodeSet) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  171. def toSeq: Seq[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → SetLike → TraversableOnce → GenTraversableOnce
  172. def toSet[B >: (GraphLike.this)#NodeT]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  173. def toSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: (GraphLike.this)#NodeOrdering = defaultNodeOrdering): String

    Sorts all nodes according to ord, concatenates them using separator and prefixes and parenthesizes the result with stringPrefix.

    Sorts all nodes according to ord, concatenates them using separator and prefixes and parenthesizes the result with stringPrefix.

    separator

    to separate nodes by.

    ord

    custom ordering.

    returns

    sorted, concatenated and prefixed string representation of this node set.

    Definition Classes
    NodeSet
  174. def toStream: Stream[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  175. def toString(): String
    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  176. def toTraversable: Traversable[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  177. def toVector: Vector[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  178. def transpose[B](implicit asTraversable: ((GraphLike.this)#NodeT) ⇒ GenTraversableOnce[B]): Set[Set[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  179. def union(that: GenSet[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → GenSetLike
  180. def unzip[A1, A2](implicit asPair: ((GraphLike.this)#NodeT) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  181. def unzip3[A1, A2, A3](implicit asTriple: ((GraphLike.this)#NodeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  182. def update(elem: (GraphLike.this)#NodeT, included: Boolean): Unit
    Definition Classes
    SetLike
  183. val value: (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to OuterNode[(GraphLike.this)#NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  184. def view(from: Int, until: Int): IterableView[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableLike → TraversableLike
  185. def view: IterableView[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableLike → TraversableLike
  186. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  187. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  188. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  189. def withFilter(p: ((GraphLike.this)#NodeT) ⇒ Boolean): FilterMonadic[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]
    Definition Classes
    TraversableLike → FilterMonadic
  190. def withSetFilter(p: ((GraphLike.this)#NodeT) ⇒ Boolean): FilteredSet[(GraphLike.this)#NodeT]

    Returns a lazily filtered immutable Set.

    Returns a lazily filtered immutable Set.

    Definition Classes
    ExtSetMethods
  191. def zip[A1 >: (GraphLike.this)#NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#NodeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  192. def zipAll[B, A1 >: (GraphLike.this)#NodeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Set[(GraphLike.this)#NodeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  193. def zipWithIndex[A1 >: (GraphLike.this)#NodeT, That](implicit bf: CanBuildFrom[Set[(GraphLike.this)#NodeT], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  194. def |(that: GenSet[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    GenSetLike
  195. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to EdgeAssoc[(GraphLike.this)#NodeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  196. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to EdgeAssoc[(GraphLike.this)#NodeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  197. def →[B](y: B): ((GraphLike.this)#NodeSet, B)
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to ArrowAssoc[(GraphLike.this)#NodeSet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to any2stringadd[(GraphLike.this)#NodeSet] 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:
    (nodeSet: any2stringadd[(GraphLike.this)#NodeSet]).+(other)
    Definition Classes
    any2stringadd
  2. def andThen[A](g: (Boolean) ⇒ A): (Param[(GraphLike.this)#NodeT, EI]) ⇒ A
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to (Param[(GraphLike.this)#NodeT, 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:
    (nodeSet: (Param[(GraphLike.this)#NodeT, EI]) ⇒ Boolean).andThen(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def apply(v1: Param[(GraphLike.this)#NodeT, EI]): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to (Param[(GraphLike.this)#NodeT, 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:
    (nodeSet: (Param[(GraphLike.this)#NodeT, EI]) ⇒ Boolean).apply(v1)
    Definition Classes
    Function1
  4. def compose[A](g: (A) ⇒ Param[(GraphLike.this)#NodeT, EI]): (A) ⇒ Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to (Param[(GraphLike.this)#NodeT, 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:
    (nodeSet: (Param[(GraphLike.this)#NodeT, EI]) ⇒ Boolean).compose(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. def filter(p: ((GraphLike.this)#NodeT) ⇒ Boolean): TraversableOnce[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to MonadOps[(GraphLike.this)#NodeT] 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:
    (nodeSet: MonadOps[(GraphLike.this)#NodeT]).filter(p)
    Definition Classes
    MonadOps
  6. def flatMap[B](f: ((GraphLike.this)#NodeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to MonadOps[(GraphLike.this)#NodeT] 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:
    (nodeSet: MonadOps[(GraphLike.this)#NodeT]).flatMap(f)
    Definition Classes
    MonadOps
  7. def flatten: Iterator[N]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to FlattenOps[N] performed by method flattenTraversableOnce in scala.collection.TraversableOnce. This conversion will take place only if an implicit value of type (InnerNodeParam[N]) ⇒ TraversableOnce[N] is in scope.
    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:
    (nodeSet: FlattenOps[N]).flatten
    Definition Classes
    FlattenOps
  8. def map[B](f: ((GraphLike.this)#NodeT) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to MonadOps[(GraphLike.this)#NodeT] 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:
    (nodeSet: MonadOps[(GraphLike.this)#NodeT]).map(f)
    Definition Classes
    MonadOps
  9. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to OuterNode[(GraphLike.this)#NodeSet] 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:
    (nodeSet: OuterNode[(GraphLike.this)#NodeSet]).stringPrefix
    Definition Classes
    NodeParam
  10. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to OuterNode[(GraphLike.this)#NodeSet] 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:
    (nodeSet: OuterNode[(GraphLike.this)#NodeSet]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  11. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to (Param[(GraphLike.this)#NodeT, 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:
    (nodeSet: (Param[(GraphLike.this)#NodeT, EI]) ⇒ Boolean).toString()
    Definition Classes
    Function1 → AnyRef → Any
  12. def withFilter(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Iterator[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to MonadOps[(GraphLike.this)#NodeT] 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:
    (nodeSet: MonadOps[(GraphLike.this)#NodeT]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. def <<(cmd: Message[(GraphLike.this)#NodeT]): Unit
    Definition Classes
    SetLike → Scriptable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) scripting is deprecated

  2. def toNodeInSet: Set[N]
    Definition Classes
    NodeSet
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) Use toOuter instead

Inherited from (GraphLike.this)#NodeSet

Inherited from (GraphLike.this)#NodeSet

Inherited from ExtSetMethods[(GraphLike.this)#NodeT]

Inherited from Set[(GraphLike.this)#NodeT]

Inherited from SetLike[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]

Inherited from Cloneable[Set[(GraphLike.this)#NodeT]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[(GraphLike.this)#NodeT]

Inherited from Builder[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]

Inherited from Growable[(GraphLike.this)#NodeT]

Inherited from Clearable

Inherited from Scriptable[(GraphLike.this)#NodeT]

Inherited from Set[(GraphLike.this)#NodeT]

Inherited from SetLike[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]

Inherited from Subtractable[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]

Inherited from GenSet[(GraphLike.this)#NodeT]

Inherited from GenericSetTemplate[(GraphLike.this)#NodeT, Set]

Inherited from GenSetLike[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]

Inherited from ((GraphLike.this)#NodeT) ⇒ Boolean

Inherited from Iterable[(GraphLike.this)#NodeT]

Inherited from Iterable[(GraphLike.this)#NodeT]

Inherited from IterableLike[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]

Inherited from Equals

Inherited from GenIterable[(GraphLike.this)#NodeT]

Inherited from GenIterableLike[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]

Inherited from Traversable[(GraphLike.this)#NodeT]

Inherited from Mutable

Inherited from Traversable[(GraphLike.this)#NodeT]

Inherited from GenTraversable[(GraphLike.this)#NodeT]

Inherited from GenericTraversableTemplate[(GraphLike.this)#NodeT, Set]

Inherited from TraversableLike[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]

Inherited from GenTraversableLike[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]

Inherited from Parallelizable[(GraphLike.this)#NodeT, ParSet[(GraphLike.this)#NodeT]]

Inherited from TraversableOnce[(GraphLike.this)#NodeT]

Inherited from GenTraversableOnce[(GraphLike.this)#NodeT]

Inherited from FilterMonadic[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]

Inherited from HasNewBuilder[(GraphLike.this)#NodeT, scala.collection.mutable.Set[GraphLike.this.NodeT] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from (GraphLike.this)#NodeSet to OuterNode[(GraphLike.this)#NodeSet]

Inherited by implicit conversion CollectionsHaveToParArray from (GraphLike.this)#NodeSet to CollectionsHaveToParArray[(GraphLike.this)#NodeSet, T]

Inherited by implicit conversion MonadOps from (GraphLike.this)#NodeSet to MonadOps[(GraphLike.this)#NodeT]

Inherited by implicit conversion flattenTraversableOnce from (GraphLike.this)#NodeSet to FlattenOps[N]

Inherited by implicit conversion EdgeAssoc from (GraphLike.this)#NodeSet to EdgeAssoc[(GraphLike.this)#NodeSet]

Inherited by implicit conversion predicateToNodePredicate from (GraphLike.this)#NodeSet to (Param[(GraphLike.this)#NodeT, EI]) ⇒ Boolean

Inherited by implicit conversion graphParamsToPartition from (GraphLike.this)#NodeSet to Partitions[N, E]

Inherited by implicit conversion any2stringadd from (GraphLike.this)#NodeSet to any2stringadd[(GraphLike.this)#NodeSet]

Inherited by implicit conversion StringFormat from (GraphLike.this)#NodeSet to StringFormat[(GraphLike.this)#NodeSet]

Inherited by implicit conversion Ensuring from (GraphLike.this)#NodeSet to Ensuring[(GraphLike.this)#NodeSet]

Inherited by implicit conversion ArrowAssoc from (GraphLike.this)#NodeSet to ArrowAssoc[(GraphLike.this)#NodeSet]

Inherited by implicit conversion alternateImplicit from (GraphLike.this)#NodeSet to ForceImplicitAmbiguity

Ungrouped