NodeSet

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(that: GenSet[This.NodeT]): Set[This.NodeT]

def &~(that: GenSet[This.NodeT]): Set[This.NodeT]

def +(node: This.NodeT): This.NodeSet

def +(elem1: This.NodeT, elem2: This.NodeT, elems: This.NodeT*): Set[This.NodeT]

def ++(elems: GenTraversableOnce[This.NodeT]): Set[This.NodeT]

def ++[B >: This.NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That

def ++:[B >: This.NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That

def ++:[B >: This.NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That

def +=(edge: This.EdgeT): NodeSet.this.type

final def -(node: This.NodeT): This.NodeSetT

def -(elem1: This.NodeT, elem2: This.NodeT, elems: This.NodeT*): Set[This.NodeT]

def --(xs: GenTraversableOnce[This.NodeT]): Set[This.NodeT]

def ->[B](y: B): (This.NodeSet, B)

def /:[B](z: B)(op: (B, This.NodeT) ⇒ B): B

def :\[B](z: B)(op: (This.NodeT, B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def adjacencyListsToString: String

def aggregate[B](z: B)(seqop: (B, This.NodeT) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[A](g: (Boolean) ⇒ A): (This.NodeT) ⇒ A

def apply(elem: This.NodeT): Boolean

final def asInstanceOf[T0]: T0

def asParIterable: ParIterable[This.NodeT]

def asParSeq: ParSeq[This.NodeT]

def asSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: This.NodeOrdering = defaultNodeOrdering): String

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

def canEqual(that: Any): Boolean

def clone(): AnyRef

val coll: ExtHashSet[This.NodeT]

def collect[B, That](pf: PartialFunction[This.NodeT, B])(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That

def collectFirst[B](pf: PartialFunction[This.NodeT, B]): Option[B]

def companion: GenericCompanion[Set]

def compose[A](g: (A) ⇒ This.NodeT): (A) ⇒ Boolean

final def contains(node: This.NodeT): Boolean

def copy: This.NodeSetT

def copyToArray[B >: This.NodeT](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: This.NodeT](xs: Array[B]): Unit

def copyToArray[B >: This.NodeT](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: This.NodeT](dest: Buffer[B]): Unit

def count(p: (This.NodeT) ⇒ Boolean): Int

def diff(that: GenSet[This.NodeT]): Set[This.NodeT]

final def draw(random: Random): This.NodeT

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

def drop(n: Int): Set[This.NodeT]

def dropRight(n: Int): Set[This.NodeT]

def dropWhile(p: (This.NodeT) ⇒ Boolean): Set[This.NodeT]

def edgeParams: Iterable[EdgeParam]

val elems: Iterable[Param[N, E]]

def empty: Set[This.NodeT]

def ensuring(cond: (This.NodeSet) ⇒ Boolean, msg: ⇒ Any): This.NodeSet

def ensuring(cond: (This.NodeSet) ⇒ Boolean): This.NodeSet

def ensuring(cond: Boolean, msg: ⇒ Any): This.NodeSet

def ensuring(cond: Boolean): This.NodeSet

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: (This.NodeT) ⇒ Boolean): Boolean

def filter(p: (This.NodeT) ⇒ Boolean): Set[This.NodeT]

def filterNot(p: (This.NodeT) ⇒ Boolean): Set[This.NodeT]

def finalize(): Unit

final def find(elem: N): Option[This.NodeT]

Finds the inner node corresponding to outerNode.

def find(p: (This.NodeT) ⇒ Boolean): Option[This.NodeT]

final def findEntry[B](toMatch: B, correspond: (This.NodeT, B) ⇒ Boolean): This.NodeT

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

def flatMap[B, That](f: (This.NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That

def flatten[B](implicit asTraversable: (This.NodeT) ⇒ GenTraversableOnce[B]): Set[B]

def fold[A1 >: This.NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, This.NodeT) ⇒ B): B

def foldRight[B](z: B)(op: (This.NodeT, B) ⇒ B): B

def forall(p: (This.NodeT) ⇒ Boolean): Boolean

def foreach[U](f: (This.NodeT) ⇒ U): Unit

def formatted(fmtstr: String): String

def from(that: AdjacencyListBase[N, E, This])(delNodes: Iterable[AdjacencyListBase.NodeT], delEdges: Iterable[AdjacencyListBase.EdgeT], ripple: Boolean, addNodes: Iterable[N], addEdges: Iterable[E[N]]): Unit

def genericBuilder[B]: Builder[B, Set[B]]

final def get(outer: N): This.NodeT

Finds the inner node corresponding to outerNode.

final def getClass(): Class[_]

def groupBy[K](f: (This.NodeT) ⇒ K): Map[K, Set[This.NodeT]]

def grouped(size: Int): Iterator[Set[This.NodeT]]

def handleNotGentlyRemovable: Boolean

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: This.NodeT

def headOption: Option[This.NodeT]

def ifParSeq[R](isbody: (ParSeq[This.NodeT]) ⇒ R): (TraversableOps[This.NodeT])#Otherwise[R]

def init: Set[This.NodeT]

def initialize(nodes: Iterable[N], edges: Iterable[E[N]]): Unit

This method is called by the primary constructor.

def inits: Iterator[Set[This.NodeT]]

def intersect(that: GenSet[This.NodeT]): Set[This.NodeT]

def isDefined: Boolean

def isEdge: Boolean

def isEmpty: Boolean

def isIn: Boolean

final def isInstanceOf[T0]: Boolean

def isNode: Boolean

def isOut: Boolean

def isParIterable: Boolean

def isParSeq: Boolean

def isParallel: Boolean

final def isTraversableAgain: Boolean

final def iterator: Iterator[This.NodeT]

def last: This.NodeT

def lastOption: Option[This.NodeT]

final def lookup(elem: N): This.NodeT

Finds the inner node corresponding to outerNode.

def map[B, That](f: (This.NodeT) ⇒ B)(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That

def max[B >: This.NodeT](implicit cmp: Ordering[B]): This.NodeT

def maxBy[B](f: (This.NodeT) ⇒ B)(implicit cmp: Ordering[B]): This.NodeT

def min[B >: This.NodeT](implicit cmp: Ordering[B]): This.NodeT

def minBy[B](f: (This.NodeT) ⇒ B)(implicit cmp: Ordering[B]): This.NodeT

final def minus(node: This.NodeT): Unit

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

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

val n1: This.NodeSet

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[This.NodeT, Set[This.NodeT]]

def nodeParams: Iterable[NodeParam[N]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParSet[This.NodeT]

def parCombiner: Combiner[This.NodeT, ParSet[This.NodeT]]

def partition(p: (This.NodeT) ⇒ Boolean): (Set[This.NodeT], Set[This.NodeT])

lazy val partitioned: (Iterable[Param[N, E]], Iterable[Param[N, E]])

def product[B >: This.NodeT](implicit num: Numeric[B]): B

def reduce[A1 >: This.NodeT](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: This.NodeT](op: (B, This.NodeT) ⇒ B): B

def reduceLeftOption[B >: This.NodeT](op: (B, This.NodeT) ⇒ B): Option[B]

def reduceOption[A1 >: This.NodeT](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: This.NodeT](op: (This.NodeT, B) ⇒ B): B

def reduceRightOption[B >: This.NodeT](op: (This.NodeT, B) ⇒ B): Option[B]

def repr: Set[This.NodeT]

def reversed: List[This.NodeT]

def sameElements[B >: This.NodeT](that: GenIterable[B]): Boolean

def scan[B >: This.NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[This.NodeT], B, That]): That

def scanLeft[B, That](z: B)(op: (B, This.NodeT) ⇒ B)(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That

def scanRight[B, That](z: B)(op: (This.NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That

def seq: Set[This.NodeT]

final def size: Int

def slice(from: Int, until: Int): Set[This.NodeT]

def sliding(size: Int, step: Int): Iterator[Set[This.NodeT]]

def sliding(size: Int): Iterator[Set[This.NodeT]]

def span(p: (This.NodeT) ⇒ Boolean): (Set[This.NodeT], Set[This.NodeT])

def splitAt(n: Int): (Set[This.NodeT], Set[This.NodeT])

def stringPrefix: String

def subsetOf(that: GenSet[This.NodeT]): Boolean

def subsets: Iterator[Set[This.NodeT]]

def subsets(len: Int): Iterator[Set[This.NodeT]]

final def subtract(node: This.NodeT, rippleDelete: Boolean, minusNode: (This.NodeT) ⇒ Unit, minusEdges: (This.NodeT) ⇒ Unit): Boolean

removes node either rippling or gently.

def sum[B >: This.NodeT](implicit num: Numeric[B]): B

final def synchronized[T0](arg0: ⇒ T0): T0

def tail: Set[This.NodeT]

def tails: Iterator[Set[This.NodeT]]

def take(n: Int): Set[This.NodeT]

def takeRight(n: Int): Set[This.NodeT]

def takeWhile(p: (This.NodeT) ⇒ Boolean): Set[This.NodeT]

def thisCollection: Iterable[This.NodeT]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, This.NodeT, Col[This.NodeT]]): Col[This.NodeT]

def toArray[B >: This.NodeT](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[A1 >: This.NodeT]: Buffer[A1]

def toCollection(repr: Set[This.NodeT]): Iterable[This.NodeT]

def toInParams: Iterable[InParam[N, E]]

def toIndexedSeq: IndexedSeq[This.NodeT]

def toIterable: Iterable[This.NodeT]

def toIterator: Iterator[This.NodeT]

def toList: List[This.NodeT]

def toMap[T, U](implicit ev: <:<[This.NodeT, (T, U)]): Map[T, U]

def toOuter: Set[N]

Converts this node set to a set of outer nodes.

def toOuterEdges: Iterable[E[N]]

def toOuterNodes: Iterable[N]

def toParArray: ParArray[This.NodeT]

def toSeq: Seq[This.NodeT]

def toSet[B >: This.NodeT]: Set[B]

def toSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: This.NodeOrdering = defaultNodeOrdering): String

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

def toStream: Stream[This.NodeT]

def toString(): String

def toTraversable: Traversable[This.NodeT]

def toVector: Vector[This.NodeT]

def transpose[B](implicit asTraversable: (This.NodeT) ⇒ GenTraversableOnce[B]): Set[Set[B]]

def union(that: GenSet[This.NodeT]): Set[This.NodeT]

def unzip[A1, A2](implicit asPair: (This.NodeT) ⇒ (A1, A2)): (Set[A1], Set[A2])

def unzip3[A1, A2, A3](implicit asTriple: (This.NodeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

val value: This.NodeSet

def view(from: Int, until: Int): IterableView[This.NodeT, Set[This.NodeT]]

def view: IterableView[This.NodeT, Set[This.NodeT]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withFilter(p: (This.NodeT) ⇒ Boolean): FilterMonadic[This.NodeT, Set[This.NodeT]]

def withSetFilter(p: (This.NodeT) ⇒ Boolean): FilteredSet[This.NodeT]

Returns a lazily filtered immutable Set.

def zip[A1 >: This.NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[This.NodeT], (A1, B), That]): That

def zipAll[B, A1 >: This.NodeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Set[This.NodeT], (A1, B), That]): That

def zipWithIndex[A1 >: This.NodeT, That](implicit bf: CanBuildFrom[Set[This.NodeT], (A1, Int), That]): That

def |(that: GenSet[This.NodeT]): Set[This.NodeT]

def ~[N >: N1](n2: N): UnDiEdge[N]

def ~>[N >: N1](n2: N): DiEdge[N]

def →[B](y: B): (This.NodeSet, B)

def +(other: String): String

def andThen[A](g: (Boolean) ⇒ A): (Param[This.NodeT, EI]) ⇒ A

def apply(v1: Param[This.NodeT, EI]): Boolean

def compose[A](g: (A) ⇒ Param[This.NodeT, EI]): (A) ⇒ Boolean

def filter(p: (This.NodeT) ⇒ Boolean): TraversableOnce[This.NodeT]

def flatMap[B](f: (This.NodeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

def flatten: Iterator[N]

def map[B](f: (This.NodeT) ⇒ B): TraversableOnce[B]

val self: Any

val self: Any

def stringPrefix: String

def toString(): String

def toString(): String

def withFilter(p: (This.NodeT) ⇒ Boolean): Iterator[This.NodeT]

def /:\[A1 >: This.NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1

def toNodeInSet: Set[N]

def x: This.NodeSet

def x: This.NodeSet