Topological sort returns `Right` for graphs with cycles pruning cycles #68

Closed
andrioni opened this Issue Mar 15, 2017 · 0 comments

Comments

Projects
None yet
2 participants
@andrioni

A small repro:

scala> Graph(1 ~> 2, 4 ~> 2, 2 ~> 3, 3 ~> 4, 1 ~> 5).topologicalSort
warning: there was one feature warning; re-run with -feature for details
res0: scala.util.Either[_1.NodeT,_1.TopologicalOrder[_1.NodeT]] forSome { val _1: scalax.collection.Graph[Int,scalax.collection.GraphEdge.DiEdge] } = Right(TopologicalOrder(1, 5))

scala> Graph(1 ~> 2, 4 ~> 2, 2 ~> 3, 3 ~> 4, 1 ~> 5).isCyclic
res1: Boolean = true

@peter-empen peter-empen added the bug label Apr 19, 2017

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment