src/work/alpar/list_graph.h
changeset 508 95f8f7171bae
parent 503 769f31e9f7b0
child 515 a7eeb8af6b34
equal deleted inserted replaced
9:1048f3dd5647 10:0da2b03c39e6
   736   ///It conforms to the graph interface documented under
   736   ///It conforms to the graph interface documented under
   737   ///the description of \ref GraphSkeleton with the exception that you cannot
   737   ///the description of \ref GraphSkeleton with the exception that you cannot
   738   ///add (or delete) edges. The usual edge iterators are exists, but they are
   738   ///add (or delete) edges. The usual edge iterators are exists, but they are
   739   ///always \ref INVALID.
   739   ///always \ref INVALID.
   740   ///\sa \ref GraphSkeleton
   740   ///\sa \ref GraphSkeleton
   741   ///\se \ref EdgeSet
   741   ///\sa \ref EdgeSet
   742   class NodeSet {
   742   class NodeSet {
   743 
   743 
   744     //Nodes are double linked.
   744     //Nodes are double linked.
   745     //The free nodes are only single linked using the "next" field.
   745     //The free nodes are only single linked using the "next" field.
   746     struct NodeT 
   746     struct NodeT