# Changeset 910:5a89cacf17f1 in lemon-0.x

Ignore:
Timestamp:
09/27/04 20:11:27 (16 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1221
Message:

minor corrections

Location:
src/hugo
Files:
3 edited

### Legend:

Unmodified
 r906 #include #include #include #include /// This wrapper shows a graph with filtered node-set and /// edge-set. Given a bool-valued map on the node-set and one on /// the edge-set of the graphs, the iterators shows only the objects /// the edge-set of the graphs, the iterators show only the objects /// having true value. /// The quick brown fox iterators jump over }; /// \brief An undirected graph template. /// ///\warning Graph wrappers are in even more experimental state than the other ///parts of the lib. Use them at your own risk. /// /// An undirected graph template. /// This class works as an undirected graph and a directed graph of /// class \c Graph is used for the physical storage. /// \ingroup graphs //   /// \brief An undirected graph template. //   /// //   ///\warning Graph wrappers are in even more experimental state than the other //   ///parts of the lib. Use them at your own risk. //   /// //   /// An undirected graph template. //   /// This class works as an undirected graph and a directed graph of //   /// class \c Graph is used for the physical storage. //   /// \ingroup graphs template class UndirGraph : public UndirGraphWrapper { /// /// Suppose that for a directed graph $G=(V, A)$, /// two predicates on the edge-set, $forward_filter$, and $backward_filter$ /// two bool valued maps on the edge-set, /// $forward_filter$, and $backward_filter$ /// is given, and we are dealing with the directed graph /// a $G'=(V, \{uv : uv\in A \mbox{ and } forward_filter(uv) \mbox{ is true}\}+\{vu : uv\in A \mbox{ and } backward_filter(uv) \mbox{ is true}\})$. /// But BidirGraphWrapper is obtained from /// SubBidirGraphWrapper by considering everywhere true /// predicates both forward_filter and backward_filter. /// valued maps both for forward_filter and backward_filter. /// Finally, one of the most important applications of SubBidirGraphWrapper /// is ResGraphWrapper, which stands for the residual graph in directed /// above mentioned graph structure without its physical storage, /// that is the whole stuff eats constant memory. /// As the oppositely directed edges are logical different, /// As the oppositely directed edges are logically different, /// the maps are able to attach different values for them. template::Edge is inherited from /// Graph::Edge. It contains an extra bool flag which shows if the /// Graph::Edge. It contains an extra bool flag which is true /// if and only if the /// edge is the backward version of the original edge. class Edge : public Graph::Edge { /// \brief Residual capacity map. /// /// In generic residual graphs the residual capacity can be obtained as a map. Not tested. /// In generic residual graphs the residual capacity can be obtained /// as a map. class ResCap { protected: