COIN-OR::LEMON - Graph Library

Changeset 1866:c2de2ed28e59 in lemon-0.x


Ignore:
Timestamp:
12/19/05 15:58:09 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2440
Message:

New file and data structures: sub_graph
Moved to new group with the edge_sets

Files:
1 added
3 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r1847 r1866  
    4141
    4242/**
     43@defgroup semi_adaptors Semi-Adaptors Classes for Graphs
     44@ingroup graphs
     45\brief Graph types between real graphs and graph adaptors.
     46
     47Graph types between real graphs and graph adaptors. These classes
     48wrap graphs to give new functionality as the adaptors do it. But the
     49other way they are not light-weigth structures as the adaptors.
     50*/
     51
     52/**
    4353@defgroup maps Maps
    4454@ingroup datas
     
    4858new maps from existing ones.
    4959*/
    50 
    5160
    5261/**
  • lemon/Makefile.am

    r1864 r1866  
    6363        radix_sort.h \
    6464        smart_graph.h \
     65        sub_graph.h \
    6566        time_measure.h \
    6667        topology.h \
  • lemon/edge_set.h

    r1842 r1866  
    193193  };
    194194
    195   /// \ingroup graphs
     195  /// \ingroup semi_adaptors
    196196  ///
    197197  /// \brief Graph using a node set of another graph and an
     
    292292  };
    293293
    294   /// \ingroup graphs
     294  /// \ingroup semi_adaptors
    295295  ///
    296296  /// \brief Graph using a node set of another graph and an
     
    364364        Parent::erase(node);
    365365      }
     366      virtual void erase(const std::vector<Node>& nodes) {
     367        for (int i = 0; i < nodes.size(); ++i) {
     368          _edgeset.eraseNode(nodes[i]);
     369        }
     370        Parent::erase(nodes);
     371      }
    366372      virtual void clear() {
    367373        _edgeset.clearNodes();
Note: See TracChangeset for help on using the changeset viewer.