src/Pure/General/graph.scala

 import scala.annotation.tailrec
 
 
 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))
 
   def string[A]: Graph[String, A] = empty(Ordering.String)

         case Nil => add_edge(x, y)
         case cycles => throw new Graph.Cycles(cycles.map(x :: _))
       }
     }
 
-  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)
 }