Closed
Description
I want to try and find a shortest path of a constant maximum length. To do this, I tried using the withMaxDepth
filter for traversals. This works nicely with pathTo
, but shortestPathTo
ignores the restrictions.
Example:
import scalax.collection.GraphEdge._
import scalax.collection.GraphPredef._
import scalax.collection.immutable.Graph
val g = Graph(1~2, 2~3, 3~4)
val traversal = g.get(1).withSubgraph(nodes = _ < 2)
traversal.pathTo(g.get(3))
// res1: Option[g.Path] = None
val traversal2 = g.get(1).withMaxDepth(1)
traversal2.pathTo(g.get(3))
// res2: Option[g.Path] = None
traversal2.shortestPathTo(g.get(3))
// res3: Option[g.Path] = Some(Path(1, 1~2, 2, 2~3, 3))
I expect that the shortestPathTo
return None
, but instead it returns a complete path.