1.1 --- a/src/hugo/list_graph.h Thu Sep 09 07:09:11 2004 +0000
1.2 +++ b/src/hugo/list_graph.h Thu Sep 09 07:09:41 2004 +0000
1.3 @@ -25,15 +25,13 @@
1.4 /// \addtogroup graphs
1.5 /// @{
1.6
1.7 -// class SymListGraph;
1.8 -
1.9 ///A list graph class.
1.10
1.11 ///This is a simple and fast erasable graph implementation.
1.12 ///
1.13 ///It conforms to the graph interface documented under
1.14 - ///the description of \ref GraphSkeleton.
1.15 - ///\sa \ref GraphSkeleton.
1.16 + ///the description of \ref ErasableGraphSkeleton.
1.17 + ///\sa \ref ErasableGraphSkeleton.
1.18 class ListGraph {
1.19
1.20 //Nodes are double linked.
1.21 @@ -42,7 +40,6 @@
1.22 {
1.23 int first_in,first_out;
1.24 int prev, next;
1.25 - // NodeT() {}
1.26 };
1.27 //Edges are double linked.
1.28 //The free edges are only single linked using the "next_in" field.
1.29 @@ -51,8 +48,6 @@
1.30 int head, tail;
1.31 int prev_in, prev_out;
1.32 int next_in, next_out;
1.33 - //FIXME: is this necessary?
1.34 - // EdgeT() : next_in(-1), next_out(-1) prev_in(-1), prev_out(-1) {}
1.35 };
1.36
1.37 std::vector<NodeT> nodes;