Packages

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

Linear Supertypes
(GraphLike.this)#NodeSet, (GraphLike.this)#NodeSet, ExtSetMethods[(GraphLike.this)#NodeT], FilterableSet[(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. FilterableSet
  6. Set
  7. SetLike
  8. Cloneable
  9. Cloneable
  10. Cloneable
  11. Shrinkable
  12. Builder
  13. Growable
  14. Clearable
  15. Scriptable
  16. Set
  17. SetLike
  18. Subtractable
  19. GenSet
  20. GenericSetTemplate
  21. GenSetLike
  22. Function1
  23. Iterable
  24. Iterable
  25. IterableLike
  26. Equals
  27. GenIterable
  28. GenIterableLike
  29. Traversable
  30. Mutable
  31. Traversable
  32. GenTraversable
  33. GenericTraversableTemplate
  34. TraversableLike
  35. GenTraversableLike
  36. Parallelizable
  37. TraversableOnce
  38. GenTraversableOnce
  39. FilterMonadic
  40. HasNewBuilder
  41. AnyRef
  42. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by flattenTraversableOnce
  5. by EdgeAssoc
  6. by predicateToNodePredicate
  7. by TraversableEnrichments
  8. by ChainingOps
  9. by IterableEnrichments
  10. by TraversableEnrichments
  11. by any2stringadd
  12. by StringFormat
  13. by Ensuring
  14. by ArrowAssoc
  15. 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 -=(elem: (GraphLike.this)#NodeT): NodeSet.this.type
    Definition Classes
    SetLike → Shrinkable
  3. abstract def contains(elem: (GraphLike.this)#NodeT): Boolean
    Definition Classes
    SetLike → GenSetLike
  4. abstract def copy: (GraphLike.this)#NodeSetT
    Attributes
    protected
    Definition Classes
    NodeSet
  5. 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. Note that currently a near- but no true-uniform distribution is granted to allow for O(1) implementation.

    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
  6. 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
  7. 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
  8. 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
  9. abstract def initialize(nodes: Iterable[N], edges: Iterable[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[collection]
    Definition Classes
    NodeSet
  10. abstract def iterator: Iterator[(GraphLike.this)#NodeT]
    Definition Classes
    GenSetLike → GenIterableLike
  11. 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
  12. 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
  13. 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. def -=(elem1: (GraphLike.this)#NodeT, elem2: (GraphLike.this)#NodeT, elems: (GraphLike.this)#NodeT*): NodeSet.this.type
    Definition Classes
    Shrinkable
  18. 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()
  19. final def -?=(node: (GraphLike.this)#NodeT): NodeSet.this.type
    Annotations
    @inline()
  20. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  21. def add(elem: (GraphLike.this)#NodeT): Boolean
    Definition Classes
    SetLike
  22. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  23. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  24. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  25. def adjacencyListsToString: String
    Definition Classes
    NodeSet
  26. def aggregate[B](z: ⇒ B)(seqop: (B, (GraphLike.this)#NodeT) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def andThen[A](g: (Boolean) ⇒ A): ((GraphLike.this)#NodeT) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  28. def apply(elem: (GraphLike.this)#NodeT): Boolean
    Definition Classes
    GenSetLike → Function1
  29. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  30. 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
  31. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  32. def clear(): Unit
    Definition Classes
    NodeSet → SetLike → Builder → Growable → Clearable
  33. def clone(): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → Cloneable → AnyRef
  34. def collect[B, That](pf: PartialFunction[(GraphLike.this)#NodeT, B])(implicit bf: CanBuildFrom[Set[(GraphLike.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  35. def collectFirst[B](pf: PartialFunction[(GraphLike.this)#NodeT, B]): Option[B]
    Definition Classes
    TraversableOnce
  36. def companion: GenericCompanion[Set]
    Definition Classes
    Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  37. def compose[A](g: (A) ⇒ (GraphLike.this)#NodeT): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  38. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  39. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  40. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  41. def copyToBuffer[B >: (GraphLike.this)#NodeT](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  42. def count(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  43. def diff(that: AnySet[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    NodeSet → NodeSet
  44. def diff(that: GenSet[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → GenSetLike
  45. def drop(n: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  46. def dropRight(n: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike
  47. def dropWhile(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Set[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  48. def empty: Set[(GraphLike.this)#NodeT]
    Definition Classes
    GenericSetTemplate
  49. 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
  50. 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
  51. 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
  52. 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
  53. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  54. def equals(that: Any): Boolean
    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  55. def exists(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  56. def filter(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Set[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  57. def filterNot(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Set[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  58. def find(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  59. def findElem(elem: (GraphLike.this)#NodeT): Option[(GraphLike.this)#NodeT]
    Definition Classes
    ExtSetMethods
  60. 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
  61. def flatten[B](implicit asTraversable: ((GraphLike.this)#NodeT) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  62. def fold[A1 >: (GraphLike.this)#NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  63. def foldLeft[B](z: B)(op: (B, (GraphLike.this)#NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  64. def foldRight[B](z: B)(op: ((GraphLike.this)#NodeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  65. def forall(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  66. def foreach[U](f: ((GraphLike.this)#NodeT) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  67. 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()
  68. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  69. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  70. def groupBy[K](f: ((GraphLike.this)#NodeT) ⇒ K): Map[K, Set[(GraphLike.this)#NodeT]]
    Definition Classes
    TraversableLike → GenTraversableLike
  71. def grouped(size: Int): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableLike
  72. def handleNotGentlyRemovable: Boolean
    Attributes
    protected
    Definition Classes
    NodeSet
  73. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  74. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  75. def head: (GraphLike.this)#NodeT
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  76. def headOption: Option[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  77. def init: Set[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  78. def inits: Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    TraversableLike
  79. def intersect(that: GenSet[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    GenSetLike
  80. 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
  81. final 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
    Param
  82. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  83. 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
  84. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  85. 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
  86. final 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
    Param
  87. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  88. def last: (GraphLike.this)#NodeT
    Definition Classes
    TraversableLike → GenTraversableLike
  89. def lastOption: Option[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  90. 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.

  91. def mapResult[NewTo](f: (Set[(GraphLike.this)#NodeT]) ⇒ NewTo): Builder[(GraphLike.this)#NodeT, NewTo]
    Definition Classes
    Builder
  92. def max[B >: (GraphLike.this)#NodeT](implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def maxBy[B](f: ((GraphLike.this)#NodeT) ⇒ B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def min[B >: (GraphLike.this)#NodeT](implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def minBy[B](f: ((GraphLike.this)#NodeT) ⇒ B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. 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
  100. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  101. def newBuilder: Builder[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → HasNewBuilder
  102. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  104. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  105. def par: ParSet[(GraphLike.this)#NodeT]
    Definition Classes
    Parallelizable
  106. def parCombiner: Combiner[(GraphLike.this)#NodeT, ParSet[(GraphLike.this)#NodeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → Parallelizable
  107. def partition(p: ((GraphLike.this)#NodeT) ⇒ Boolean): (Set[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def pipe[B](f: ((GraphLike.this)#NodeSet) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to ChainingOps[(GraphLike.this)#NodeSet] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  109. def product[B >: (GraphLike.this)#NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def reduce[A1 >: (GraphLike.this)#NodeT](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def reduceLeft[B >: (GraphLike.this)#NodeT](op: (B, (GraphLike.this)#NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce
  112. def reduceLeftOption[B >: (GraphLike.this)#NodeT](op: (B, (GraphLike.this)#NodeT) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def reduceOption[A1 >: (GraphLike.this)#NodeT](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def reduceRight[B >: (GraphLike.this)#NodeT](op: ((GraphLike.this)#NodeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  115. def reduceRightOption[B >: (GraphLike.this)#NodeT](op: ((GraphLike.this)#NodeT, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def remove(node: (GraphLike.this)#NodeT): Boolean
    Definition Classes
    NodeSet → SetLike
  117. def removeGently(node: (GraphLike.this)#NodeT): Boolean
  118. def repr: Set[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  119. def result(): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → Builder
  120. def retain(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Unit
    Definition Classes
    SetLike
  121. def reversed: List[(GraphLike.this)#NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  122. def sameElements[B >: (GraphLike.this)#NodeT](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  123. 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
  124. 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
  125. 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.

  126. def seq: Set[(GraphLike.this)#NodeT]
    Definition Classes
    Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  127. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  129. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  130. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  131. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  132. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  133. def slice(from: Int, until: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  134. def sliding(size: Int, step: Int): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableLike
  135. def sliding(size: Int): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableLike
  136. def span(p: ((GraphLike.this)#NodeT) ⇒ Boolean): (Set[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  137. def splitAt(n: Int): (Set[(GraphLike.this)#NodeT], Set[(GraphLike.this)#NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  138. def stringPrefix: String
    Definition Classes
    NodeSet → SetLike → TraversableLike → GenTraversableLike
  139. def subsetOf(that: GenSet[(GraphLike.this)#NodeT]): Boolean
    Definition Classes
    GenSetLike
  140. def subsets(): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    SetLike
  141. def subsets(len: Int): Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    SetLike
  142. 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[collection]
    Definition Classes
    NodeSet
  143. def sum[B >: (GraphLike.this)#NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  145. val t: Set[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to TraversableEnrichments[(GraphLike.this)#NodeT, Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  146. def tail: Set[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  147. def tails: Iterator[Set[(GraphLike.this)#NodeT]]
    Definition Classes
    TraversableLike
  148. def take(n: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  149. def takeRight(n: Int): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike
  150. def takeWhile(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Set[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  151. def tap[U](f: ((GraphLike.this)#NodeSet) ⇒ U): (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to ChainingOps[(GraphLike.this)#NodeSet] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  152. def thisCollection: Iterable[(GraphLike.this)#NodeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  153. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (GraphLike.this)#NodeT, Col[(GraphLike.this)#NodeT]]): Col[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  154. def toArray[B >: (GraphLike.this)#NodeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  155. def toBuffer[A1 >: (GraphLike.this)#NodeT]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  156. def toCollection(repr: Set[(GraphLike.this)#NodeT]): Iterable[(GraphLike.this)#NodeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  157. def toIndexedSeq: IndexedSeq[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  158. def toIterable: Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  159. def toIterator: Iterator[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  160. def toList: List[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  161. def toMap[T, U](implicit ev: <:<[(GraphLike.this)#NodeT, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  162. 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
  163. def toOuterNodes[E[+X] <: EdgeLike[X]]: Seq[InParam[(GraphLike.this)#NodeT, E]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to TraversableEnrichments[(GraphLike.this)#NodeT, Set] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  164. 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
  165. def toSeq: Seq[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → SetLike → TraversableOnce → GenTraversableOnce
  166. def toSet[B >: (GraphLike.this)#NodeT]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  167. 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
  168. def toStream: Stream[(GraphLike.this)#NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  169. def toString(): String
    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  170. def toTraversable: Traversable[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  171. def toVector: Vector[(GraphLike.this)#NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  172. 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.

  173. def union(that: GenSet[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    SetLike → GenSetLike
  174. def unzip[A1, A2](implicit asPair: ((GraphLike.this)#NodeT) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  175. def unzip3[A1, A2, A3](implicit asTriple: ((GraphLike.this)#NodeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  176. def update(elem: (GraphLike.this)#NodeT, included: Boolean): Unit
    Definition Classes
    SetLike
  177. 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
  178. def view(from: Int, until: Int): IterableView[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableLike → TraversableLike
  179. def view: IterableView[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableLike → TraversableLike
  180. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  181. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  182. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  183. def withFilter(p: ((GraphLike.this)#NodeT) ⇒ Boolean): FilterMonadic[(GraphLike.this)#NodeT, Set[(GraphLike.this)#NodeT]]
    Definition Classes
    TraversableLike → FilterMonadic
  184. def withSetFilter(p: ((GraphLike.this)#NodeT) ⇒ Boolean): Set[(GraphLike.this)#NodeT] with FilterableSet[(GraphLike.this)#NodeT]
    Definition Classes
    FilterableSet
  185. 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
  186. 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
  187. def zipWithIndex[A1 >: (GraphLike.this)#NodeT, That](implicit bf: CanBuildFrom[Set[(GraphLike.this)#NodeT], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  188. def |(that: GenSet[(GraphLike.this)#NodeT]): Set[(GraphLike.this)#NodeT]
    Definition Classes
    GenSetLike
  189. 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()
  190. 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()
  191. 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. val self: (GraphLike.this)#NodeSet
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to ChainingOps[(GraphLike.this)#NodeSet] performed by method ChainingOps in scalax.collection.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (nodeSet: ChainingOps[(GraphLike.this)#NodeSet]).self
    Definition Classes
    ChainingOps
  10. val self: Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to IterableEnrichments[(GraphLike.this)#NodeT] performed by method IterableEnrichments in scalax.collection.Compat.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (nodeSet: IterableEnrichments[(GraphLike.this)#NodeT]).self
    Definition Classes
    IterableEnrichments
  11. val self: Traversable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to TraversableEnrichments[(GraphLike.this)#NodeT] performed by method TraversableEnrichments in scalax.collection.Compat.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (nodeSet: TraversableEnrichments[(GraphLike.this)#NodeT]).self
    Definition Classes
    TraversableEnrichments
  12. 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
  13. def toMSet: MSet[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to IterableEnrichments[(GraphLike.this)#NodeT] performed by method IterableEnrichments in scalax.collection.Compat.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (nodeSet: IterableEnrichments[(GraphLike.this)#NodeT]).toMSet
    Definition Classes
    IterableEnrichments
  14. def toMSet: MSet[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to TraversableEnrichments[(GraphLike.this)#NodeT] performed by method TraversableEnrichments in scalax.collection.Compat.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (nodeSet: TraversableEnrichments[(GraphLike.this)#NodeT]).toMSet
    Definition Classes
    TraversableEnrichments
  15. def toSet: Set[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#NodeSet to TraversableEnrichments[(GraphLike.this)#NodeT] performed by method TraversableEnrichments in scalax.collection.Compat.
    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: TraversableEnrichments[(GraphLike.this)#NodeT]).toSet
    Definition Classes
    TraversableEnrichments
  16. 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
  17. 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
  18. 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 /:[B](z: B)(op: (B, (GraphLike.this)#NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: ((GraphLike.this)#NodeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

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

    (Since version 2.11.0) scripting is deprecated

  4. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated @deprecated
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

  5. 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 FilterableSet[(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 TraversableEnrichments from (GraphLike.this)#NodeSet to TraversableEnrichments[(GraphLike.this)#NodeT, Set]

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

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

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

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