Abstract Value Members
-
-
abstract
def
endNode: NodeT
-
abstract
def
foreach[U](f: (OutParam[N, E]) ⇒ U): Unit
-
abstract
def
isValid: Boolean
-
-
abstract
def
startNode: NodeT
Concrete Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
-
-
-
def
->[B](y: B): (Path, B)
-
def
/:[B](z: B)(op: (B, OutParam[N, E]) ⇒ B): B
-
def
:\[B](z: B)(op: (OutParam[N, E], B) ⇒ B): B
-
-
final
def
==(arg0: Any): Boolean
-
-
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: B)(seqop: (B, OutParam[N, E]) ⇒ B, combop: (B, B) ⇒ B): B
-
final
def
asInstanceOf[T0]: T0
-
-
-
def
clone(): AnyRef
-
-
-
-
def
copyToArray[B >: OutParam[N, E]](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: OutParam[N, E]](xs: Array[B]): Unit
-
def
copyToArray[B >: OutParam[N, E]](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: OutParam[N, E]](dest: Buffer[B]): Unit
-
-
-
-
-
-
def
ensuring(cond: Boolean, msg: ⇒ Any): Path
-
-
-
-
-
-
-
def
finalize(): Unit
-
-
-
-
def
fold[A1 >: OutParam[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, OutParam[N, E]) ⇒ B): B
-
def
foldRight[B](z: B)(op: (OutParam[N, E], B) ⇒ B): B
-
-
def
formatted(fmtstr: String): String
-
-
final
def
getClass(): Class[_]
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
-
-
-
-
-
def
isDefined: Boolean
-
-
-
-
final
def
isInstanceOf[T0]: Boolean
-
-
-
def
isParIterable: Boolean
-
-
def
isParallel: Boolean
-
final
def
isTraversableAgain: Boolean
-
-
-
def
length: Int
-
-
-
def
maxBy[B](f: (OutParam[N, E]) ⇒ B)(implicit cmp: Ordering[B]): OutParam[N, E]
-
-
def
minBy[B](f: (OutParam[N, E]) ⇒ B)(implicit cmp: Ordering[B]): OutParam[N, E]
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
-
-
def
product[B >: OutParam[N, E]](implicit num: Numeric[B]): B
-
def
reduce[A1 >: OutParam[N, E]](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: OutParam[N, E]](op: (B, OutParam[N, E]) ⇒ B): B
-
def
reduceLeftOption[B >: OutParam[N, E]](op: (B, OutParam[N, E]) ⇒ B): Option[B]
-
def
reduceOption[A1 >: OutParam[N, E]](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: OutParam[N, E]](op: (OutParam[N, E], B) ⇒ B): B
-
def
reduceRightOption[B >: OutParam[N, E]](op: (OutParam[N, E], B) ⇒ B): Option[B]
-
-
-
def
scan[B >: OutParam[N, E], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[OutParam[N, E]], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, OutParam[N, E]) ⇒ B)(implicit bf: CanBuildFrom[Traversable[OutParam[N, E]], B, That]): That
-
def
scanRight[B, That](z: B)(op: (OutParam[N, E], B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[OutParam[N, E]], B, That]): That
-
-
def
size: Int
-
-
-
-
def
stringPrefix: String
-
def
sum[B >: OutParam[N, E]](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
-
-
-
def
toArray[B >: OutParam[N, E]](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[B >: OutParam[N, E]]: Buffer[B]
-
-
-
-
-
-
def
toMap[T, U](implicit ev: <:<[OutParam[N, E], (T, U)]): Map[T, U]
-
-
-
def
toSet[B >: OutParam[N, E]]: Set[B]
-
-
def
toString(): String
-
-
-
-
def
unzip[A1, A2](implicit asPair: (OutParam[N, E]) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (OutParam[N, E]) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
-
val
value: Path
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
weight: Long
-
-
def
~[N >: N1, N2 <: N](n2: N2): UnDiEdge[N]
-
def
~>[N >: N1, N2 <: N](n2: N2): DiEdge[N]
-
def
→[B](y: B): (Path, B)
Shadowed Implicit Value Members
-
-
-
-
val
self: Any
-
val
self: Any
-
def
stringPrefix: String
-
def
toString(): String
-
Deprecated Value Members
-
def
/:\[A1 >: OutParam[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1
-
-
Inherited by implicit conversion MonadOps from
Path to MonadOps[OutParam[N, E]]
Inherited by implicit conversion any2stringadd from
Path to StringAdd
Inherited by implicit conversion any2ArrowAssoc from
Path to ArrowAssoc[Path]
Inherited by implicit conversion any2Ensuring from
Path to Ensuring[Path]
Inherited by implicit conversion alternateImplicit from
Path to ForceImplicitAmbiguity
Represents a path in this graph listing the nodes and connecting edges on it with the following syntax:
path ::= node { edge node }
All nodes and edges on the path are distinct. A 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 tail being the start node and its head being the third element etc.