1.1 --- a/src/work/alpar/list_graph.h Mon Apr 26 09:06:13 2004 +0000
1.2 +++ b/src/work/alpar/list_graph.h Mon Apr 26 09:21:27 2004 +0000
1.3 @@ -797,8 +797,10 @@
1.4
1.5 public:
1.6
1.7 + ///Default constructor
1.8 NodeSet() : nodes(), first_node(-1),
1.9 first_free_node(-1) {}
1.10 + ///Copy constructor
1.11 NodeSet(const NodeSet &_g) : nodes(_g.nodes), first_node(_g.first_node),
1.12 first_free_node(_g.first_free_node) {}
1.13
1.14 @@ -1215,9 +1217,18 @@
1.15
1.16 public:
1.17
1.18 + ///Constructor
1.19 +
1.20 + ///Construates a new graph based on the nodeset of an existing one.
1.21 + ///\param _G the base graph.
1.22 + ///\todo It looks like a copy constructor, but it isn't.
1.23 EdgeSet(NodeGraphType &_G) : G(_G),
1.24 nodes(_G), edges(),
1.25 first_free_edge(-1) { }
1.26 + ///Copy constructor
1.27 +
1.28 + ///Makes a copy of an EdgeSet.
1.29 + ///It will be based on the same graph.
1.30 EdgeSet(const EdgeSet &_g) : G(_g.G), nodes(_g.G), edges(_g.edges),
1.31 first_free_edge(_g.first_free_edge) { }
1.32