# HG changeset patch
# User alpar
# Date 1082971287 0
# Node ID cc8629dc293551ffc481889aa9c0289c65172cc7
# Parent  e34e1bc610cfa5957feb189cc60ae2ded7a57c05
Some more docs.

diff -r e34e1bc610cf -r cc8629dc2935 src/work/alpar/list_graph.h
--- a/src/work/alpar/list_graph.h	Mon Apr 26 09:06:13 2004 +0000
+++ b/src/work/alpar/list_graph.h	Mon Apr 26 09:21:27 2004 +0000
@@ -797,8 +797,10 @@
     
   public:
 
+    ///Default constructor
     NodeSet() : nodes(), first_node(-1),
 		  first_free_node(-1) {}
+    ///Copy constructor
     NodeSet(const NodeSet &_g) : nodes(_g.nodes), first_node(_g.first_node),
 				     first_free_node(_g.first_free_node) {}
     
@@ -1215,9 +1217,18 @@
     
   public:
 
+    ///Constructor
+    
+    ///Construates a new graph based on the nodeset of an existing one.
+    ///\param _G the base graph.
+    ///\todo It looks like a copy constructor, but it isn't.
     EdgeSet(NodeGraphType &_G) : G(_G),
 				 nodes(_G), edges(),
 				 first_free_edge(-1) { }
+    ///Copy constructor
+
+    ///Makes a copy of an EdgeSet.
+    ///It will be based on the same graph.
     EdgeSet(const EdgeSet &_g) : G(_g.G), nodes(_g.G), edges(_g.edges),
 				 first_free_edge(_g.first_free_edge) { }