diff -r 157115b5814a -r 738abd9d1262 src/hugo/list_graph.h
--- a/src/hugo/list_graph.h	Thu Sep 09 07:09:11 2004 +0000
+++ b/src/hugo/list_graph.h	Thu Sep 09 07:09:41 2004 +0000
@@ -25,15 +25,13 @@
 /// \addtogroup graphs
 /// @{
 
-//  class SymListGraph;
-
   ///A list graph class.
 
   ///This is a simple and fast erasable graph implementation.
   ///
   ///It conforms to the graph interface documented under
-  ///the description of \ref GraphSkeleton.
-  ///\sa \ref GraphSkeleton.
+  ///the description of \ref ErasableGraphSkeleton.
+  ///\sa \ref ErasableGraphSkeleton.
   class ListGraph {
 
     //Nodes are double linked.
@@ -42,7 +40,6 @@
     {
       int first_in,first_out;
       int prev, next;
-      //      NodeT() {}
     };
     //Edges are double linked.
     //The free edges are only single linked using the "next_in" field.
@@ -51,8 +48,6 @@
       int head, tail;
       int prev_in, prev_out;
       int next_in, next_out;
-      //FIXME: is this necessary?
-      //      EdgeT() : next_in(-1), next_out(-1) prev_in(-1), prev_out(-1) {}  
     };
 
     std::vector<NodeT> nodes;