# Changeset 641:bfd6c14e2975 in lemon-0.x

Ignore:
Timestamp:
05/14/04 20:08:29 (16 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@839
Message:

some documentation in stGraphWrapper<Gr> and BipartiteGraphWrapper?<Gr>

File:
1 edited

Unmodified
Added
Removed
• ## src/work/marci/bipartite_graph_wrapper.h

 r558 namespace hugo { /// \brief A wrapper for composing a bipartite graph from a graph /// and from a node-map showing for any node which color class it belongs to. /// /// A wrapper for composing a bipartite graph. /// \c _graph have to be a reference to a graph of type \c Graph /// graph or a directed graph with edges oriented from S to T. /// ///\author Marton Makai /// \author Marton Makai template class BipartiteGraphWrapper : public GraphWrapper { } /// Returns true iff \c n is in S. bool inSClass(const Node& n) const { return !(*(this->s_false_t_true_map))[n]; } /// Returns true iff \c n is in T. bool inTClass(const Node& n) const { return (*(this->s_false_t_true_map))[n]; const bool BipartiteGraphWrapper::T_CLASS=true; ///\bug Do not use this while the bipartitemap augmentation /// \brief A bipartite graph template class /// /// This class composes a bipartite graph over a directed or undirected /// graph structure of type \c Graph. /// \c _graph have to be a reference to a graph of type \c Graph /// and \c _s_false_t_true_map is an \c IterableBoolMap /// reference containing the elements for the /// color classes S and T. \c _graph is to be referred to an undirected /// graph or a directed graph with edges oriented from S to T. /// ///\bug experimental. Do not use this while the bipartitemap augmentation /// does not work well. template //   } /// experimentral, do not try it. /// It eats a bipartite graph, oriented from S to T. /// Such one can be made e.g. by the above wrapper. /// \brief A wrapper for adding extra nodes s and t to a bipartite graph /// and edges from s to each node of S and form each node of T to t. /// /// A wrapper for adding extra nodes s and t to a bipartite graph /// and edges from s to each node of S and form each node of T to t. /// This class is very useful to reduce some matching or more /// generally, capacitataed b-matching problem to a flow problem. /// According to the bipartite graph concepts the bipartite /// graph have to be oriented from S to T. /// ///\author Marton Makai /// \author Marton Makai template class stGraphWrapper : public GraphWrapper {
Note: See TracChangeset for help on using the changeset viewer.