Changeset 408:cc8629dc2935 in lemon-0.x for src/work
- Timestamp:
- 04/26/04 11:21:27 (21 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@541
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/work/alpar/list_graph.h
r406 r408 798 798 public: 799 799 800 ///Default constructor 800 801 NodeSet() : nodes(), first_node(-1), 801 802 first_free_node(-1) {} 803 ///Copy constructor 802 804 NodeSet(const NodeSet &_g) : nodes(_g.nodes), first_node(_g.first_node), 803 805 first_free_node(_g.first_free_node) {} … … 1216 1218 public: 1217 1219 1220 ///Constructor 1221 1222 ///Construates a new graph based on the nodeset of an existing one. 1223 ///\param _G the base graph. 1224 ///\todo It looks like a copy constructor, but it isn't. 1218 1225 EdgeSet(NodeGraphType &_G) : G(_G), 1219 1226 nodes(_G), edges(), 1220 1227 first_free_edge(-1) { } 1228 ///Copy constructor 1229 1230 ///Makes a copy of an EdgeSet. 1231 ///It will be based on the same graph. 1221 1232 EdgeSet(const EdgeSet &_g) : G(_g.G), nodes(_g.G), edges(_g.edges), 1222 1233 first_free_edge(_g.first_free_edge) { }
Note: See TracChangeset
for help on using the changeset viewer.