--- a/src/Pure/General/graph.scala Thu Jul 19 12:37:08 2012 +0200
+++ b/src/Pure/General/graph.scala Thu Jul 19 14:15:08 2012 +0200
@@ -14,9 +14,9 @@
object Graph
{
- class Duplicate[Key](x: Key) extends Exception
- class Undefined[Key](x: Key) extends Exception
- class Cycles[Key](cycles: List[List[Key]]) extends Exception
+ class Duplicate[Key](val key: Key) extends Exception
+ class Undefined[Key](val key: Key) extends Exception
+ class Cycles[Key](val cycles: List[List[Key]]) extends Exception
def empty[Key, A](implicit ord: Ordering[Key]): Graph[Key, A] =
new Graph[Key, A](SortedMap.empty(ord))
@@ -209,7 +209,7 @@
}
}
- def add_deps_cyclic(y: Key, xs: List[Key]): Graph[Key, A] =
+ def add_deps_acyclic(y: Key, xs: List[Key]): Graph[Key, A] =
(this /: xs)(_.add_edge_acyclic(_, y))
def topological_order: List[Key] = all_succs(minimals)