trait Path extends Walk
Represents a path in this graph where
path ::= node { edge node }
Nodes and edges on the path are distinct. A walk/path contains at least one node followed by any number of consecutive pairs of an edge and a node. The first element is the start node, the second is an edge with its source being the start node and its target being the third element etc.
Linear Supertypes
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- Path
- Walk
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
Implicitly
- by anyToNode
- by CollectionsHaveToParArray
- by MonadOps
- by EdgeAssoc
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- by alternateImplicit
- Hide All
- Show All
Visibility
- Public
- All
Type Members
-
type
Self = Traversable[GraphTraversal.InnerElem]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
-
trait
NodeValidator extends (NodeT) ⇒ Boolean
- Attributes
- protected
- Definition Classes
- Walk
Abstract Value Members
-
abstract
def
edges: Traversable[GraphTraversal.EdgeT]
All edges of this path/walk in proper order.
All edges of this path/walk in proper order.
- Definition Classes
- Walk
-
abstract
def
endNode: NodeT
- Definition Classes
- Walk
-
abstract
def
nodes: Traversable[NodeT]
All nodes on this path/walk in proper order.
All nodes on this path/walk in proper order.
- Definition Classes
- Walk
-
abstract
def
startNode: NodeT
- Definition Classes
- Walk
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
-
def
++[B >: GraphTraversal.InnerElem, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphTraversal.InnerElem], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: GraphTraversal.InnerElem, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[GraphTraversal.InnerElem], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: GraphTraversal.InnerElem, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphTraversal.InnerElem], B, That]): That
- Definition Classes
- TraversableLike
- def ->[B](y: B): (Path, B)
-
def
/:[B](z: B)(op: (B, GraphTraversal.InnerElem) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: (GraphTraversal.InnerElem, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, GraphTraversal.InnerElem) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collect[B, That](pf: PartialFunction[GraphTraversal.InnerElem, B])(implicit bf: CanBuildFrom[Traversable[GraphTraversal.InnerElem], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[GraphTraversal.InnerElem, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[Traversable]
- Definition Classes
- Traversable → GenTraversable → GenericTraversableTemplate
-
final
def
containingGraph: GraphTraversal.this.type
The
Graphinstance that containsthiswalk.The
Graphinstance that containsthiswalk.- Definition Classes
- Walk
-
def
copyToArray[B >: GraphTraversal.InnerElem](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: GraphTraversal.InnerElem](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: GraphTraversal.InnerElem](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: GraphTraversal.InnerElem](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: (GraphTraversal.InnerElem) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
drop(n: Int): Traversable[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
dropWhile(p: (GraphTraversal.InnerElem) ⇒ Boolean): Traversable[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
- def ensuring(cond: (Path) ⇒ Boolean, msg: ⇒ Any): Path
- def ensuring(cond: (Path) ⇒ Boolean): Path
- def ensuring(cond: Boolean, msg: ⇒ Any): Path
- def ensuring(cond: Boolean): Path
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
exists(p: (GraphTraversal.InnerElem) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: (GraphTraversal.InnerElem) ⇒ Boolean): Traversable[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (GraphTraversal.InnerElem) ⇒ Boolean): Traversable[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: (GraphTraversal.InnerElem) ⇒ Boolean): Option[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
flatMap[B, That](f: (GraphTraversal.InnerElem) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphTraversal.InnerElem], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (GraphTraversal.InnerElem) ⇒ GenTraversableOnce[B]): Traversable[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: GraphTraversal.InnerElem](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, GraphTraversal.InnerElem) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (GraphTraversal.InnerElem, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
forall(p: (GraphTraversal.InnerElem) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (GraphTraversal.InnerElem) ⇒ U): Unit
- Definition Classes
- Walk → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
- def formatted(fmtstr: String): String
-
def
genericBuilder[B]: Builder[B, Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
groupBy[K](f: (GraphTraversal.InnerElem) ⇒ K): Map[K, Traversable[GraphTraversal.InnerElem]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
head: GraphTraversal.InnerElem
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
headOption: Option[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
init: Traversable[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[Traversable[GraphTraversal.InnerElem]]
- Definition Classes
- TraversableLike
-
def
isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from Path to OuterNode[Path] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
-
def
isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from Path to OuterNode[Path] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isEmpty: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- def isIn: Boolean
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isNode: Boolean
- Implicit
- This member is added by an implicit conversion from Path to OuterNode[Path] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
- def isOut: Boolean
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
isValid: Boolean
Returns whether the nodes and edges on this path are valid with respect to this graph.
-
def
last: GraphTraversal.InnerElem
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
length: Int
The number of edges on this path/walk.
The number of edges on this path/walk.
- Definition Classes
- Walk
-
def
map[B, That](f: (GraphTraversal.InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphTraversal.InnerElem], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
max[B >: GraphTraversal.InnerElem](implicit cmp: Ordering[B]): GraphTraversal.InnerElem
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (GraphTraversal.InnerElem) ⇒ B)(implicit cmp: Ordering[B]): GraphTraversal.InnerElem
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: GraphTraversal.InnerElem](implicit cmp: Ordering[B]): GraphTraversal.InnerElem
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (GraphTraversal.InnerElem) ⇒ B)(implicit cmp: Ordering[B]): GraphTraversal.InnerElem
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
val
n1: Path
- Implicit
- This member is added by an implicit conversion from Path to EdgeAssoc[Path] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[GraphTraversal.InnerElem, Traversable[GraphTraversal.InnerElem]]
- Attributes
- protected[this]
- Definition Classes
- GenericTraversableTemplate → HasNewBuilder
- def nodeValidator: NodeValidator
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
par: ParIterable[GraphTraversal.InnerElem]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[GraphTraversal.InnerElem, ParIterable[GraphTraversal.InnerElem]]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike → Parallelizable
-
def
partition(p: (GraphTraversal.InnerElem) ⇒ Boolean): (Traversable[GraphTraversal.InnerElem], Traversable[GraphTraversal.InnerElem])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
product[B >: GraphTraversal.InnerElem](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: GraphTraversal.InnerElem](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: GraphTraversal.InnerElem](op: (B, GraphTraversal.InnerElem) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: GraphTraversal.InnerElem](op: (B, GraphTraversal.InnerElem) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: GraphTraversal.InnerElem](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: GraphTraversal.InnerElem](op: (GraphTraversal.InnerElem, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: GraphTraversal.InnerElem](op: (GraphTraversal.InnerElem, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: Traversable[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reversed: List[GraphTraversal.InnerElem]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
scan[B >: GraphTraversal.InnerElem, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[GraphTraversal.InnerElem], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, GraphTraversal.InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphTraversal.InnerElem], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (GraphTraversal.InnerElem, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphTraversal.InnerElem], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
- @migration
- Migration
(Changed in version 2.9.0) The behavior of
scanRighthas changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
seq: Traversable[GraphTraversal.InnerElem]
- Definition Classes
- Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
The number of nodes and edges on this path/walk.
The number of nodes and edges on this path/walk.
- Definition Classes
- Walk → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): Traversable[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
span(p: (GraphTraversal.InnerElem) ⇒ Boolean): (Traversable[GraphTraversal.InnerElem], Traversable[GraphTraversal.InnerElem])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (Traversable[GraphTraversal.InnerElem], Traversable[GraphTraversal.InnerElem])
- Definition Classes
- TraversableLike → GenTraversableLike
- def stringPrefix: String
-
def
sum[B >: GraphTraversal.InnerElem](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: Traversable[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[Traversable[GraphTraversal.InnerElem]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): Traversable[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
takeWhile(p: (GraphTraversal.InnerElem) ⇒ Boolean): Traversable[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
thisCollection: Traversable[GraphTraversal.InnerElem]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, GraphTraversal.InnerElem, Col[GraphTraversal.InnerElem]]): Col[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: GraphTraversal.InnerElem](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: GraphTraversal.InnerElem]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: Traversable[GraphTraversal.InnerElem]): Traversable[GraphTraversal.InnerElem]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
toIndexedSeq: IndexedSeq[GraphTraversal.InnerElem]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[GraphTraversal.InnerElem]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toList: List[GraphTraversal.InnerElem]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[GraphTraversal.InnerElem, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from Path to CollectionsHaveToParArray[Path, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (Path) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
def
toSeq: Seq[GraphTraversal.InnerElem]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSet[B >: GraphTraversal.InnerElem]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- TraversableLike → Any
-
def
toTraversable: Traversable[GraphTraversal.InnerElem]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[GraphTraversal.InnerElem]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transpose[B](implicit asTraversable: (GraphTraversal.InnerElem) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transposethrows anIllegalArgumentExceptionif collections are not uniformly sized.
-
def
unzip[A1, A2](implicit asPair: (GraphTraversal.InnerElem) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (GraphTraversal.InnerElem) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
- Definition Classes
- GenericTraversableTemplate
- val value: Path
-
def
view(from: Int, until: Int): TraversableView[GraphTraversal.InnerElem, Traversable[GraphTraversal.InnerElem]]
- Definition Classes
- TraversableLike
-
def
view: TraversableView[GraphTraversal.InnerElem, Traversable[GraphTraversal.InnerElem]]
- Definition Classes
- TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
weight[T](f: (GraphTraversal.EdgeT) ⇒ T)(implicit arg0: Numeric[T]): T
The cumulated weight of all edges on this path/walk.
The cumulated weight of all edges on this path/walk.
- f
The weight function overriding edge weights.
- Definition Classes
- Walk
-
final
def
weight: Double
The cumulated weight of all edges on this path/walk.
The cumulated weight of all edges on this path/walk.
- Definition Classes
- Walk
-
def
withFilter(p: (GraphTraversal.InnerElem) ⇒ Boolean): FilterMonadic[GraphTraversal.InnerElem, Traversable[GraphTraversal.InnerElem]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from Path to EdgeAssoc[Path] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
-
def
~>[N >: N1](n2: N): DiEdge[N]
- Implicit
- This member is added by an implicit conversion from Path to EdgeAssoc[Path] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
- def →[B](y: B): (Path, B)
Shadowed Implicit Value Members
-
def
filter(p: (GraphTraversal.InnerElem) ⇒ Boolean): TraversableOnce[GraphTraversal.InnerElem]
- Implicit
- This member is added by an implicit conversion from Path to MonadOps[GraphTraversal.InnerElem] 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:(path: MonadOps[GraphTraversal.InnerElem]).filter(p)
- Definition Classes
- MonadOps
-
def
flatMap[B](f: (GraphTraversal.InnerElem) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from Path to MonadOps[GraphTraversal.InnerElem] 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:(path: MonadOps[GraphTraversal.InnerElem]).flatMap(f)
- Definition Classes
- MonadOps
-
def
map[B](f: (GraphTraversal.InnerElem) ⇒ B): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from Path to MonadOps[GraphTraversal.InnerElem] 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:(path: MonadOps[GraphTraversal.InnerElem]).map(f)
- Definition Classes
- MonadOps
-
def
stringPrefix: String
- Implicit
- This member is added by an implicit conversion from Path to OuterNode[Path] 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:(path: OuterNode[Path]).stringPrefix
- Definition Classes
- NodeParam
-
def
toString(): String
- Implicit
- This member is added by an implicit conversion from Path to OuterNode[Path] 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:(path: OuterNode[Path]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
-
def
withFilter(p: (GraphTraversal.InnerElem) ⇒ Boolean): Iterator[GraphTraversal.InnerElem]
- Implicit
- This member is added by an implicit conversion from Path to MonadOps[GraphTraversal.InnerElem] 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:(path: MonadOps[GraphTraversal.InnerElem]).withFilter(p)
- Definition Classes
- MonadOps
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.