EvaluableGraphNeighboursTraversal
com.phasmidsoftware.gryphon.core.EvaluableGraphNeighboursTraversal
abstract class EvaluableGraphNeighboursTraversal[V, T, R](fulfill: V => T)(traversable: Traversable[V])(using random: Random) extends GraphNeighboursTraversal[V, R]
An abstract class that extends the functionality of GraphNeighboursTraversal by incorporating an evaluable mechanism for the vertices of the graph. This class allows the evaluation of graph vertices to produce a value of type T through the provided fulfillment function.
Type parameters
- R
-
The type representing the result of the traversal operation.
- T
-
The type produced when a vertex is evaluated.
- V
-
The type representing a vertex in the graph.
Value parameters
- fulfill
-
A function that maps a vertex of type
Vto a value of typeT. - traversable
-
A traversable collection of vertices of type
Vrepresenting the graph.
Attributes
- Graph
-
- Supertypes
Members list
In this article