Changeset 641:bfd6c14e2975 in lemon0.x
 Timestamp:
 05/14/04 20:08:29 (19 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@839
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/marci/bipartite_graph_wrapper.h
r558 r641 17 17 namespace hugo { 18 18 19 /// \brief A wrapper for composing a bipartite graph from a graph 20 /// and from a nodemap showing for any node which color class it belongs to. 21 /// 19 22 /// A wrapper for composing a bipartite graph. 20 23 /// \c _graph have to be a reference to a graph of type \c Graph … … 24 27 /// graph or a directed graph with edges oriented from S to T. 25 28 /// 26 /// \author Marton Makai29 /// \author Marton Makai 27 30 template<typename Graph> 28 31 class BipartiteGraphWrapper : public GraphWrapper<Graph> { … … 177 180 } 178 181 182 /// Returns true iff \c n is in S. 179 183 bool inSClass(const Node& n) const { 180 184 return !(*(this>s_false_t_true_map))[n]; 181 185 } 186 187 /// Returns true iff \c n is in T. 182 188 bool inTClass(const Node& n) const { 183 189 return (*(this>s_false_t_true_map))[n]; … … 191 197 const bool BipartiteGraphWrapper<G>::T_CLASS=true; 192 198 193 194 195 196 197 198 199 200 201 202 203 204 ///\bug Do not use this while the bipartitemap augmentation 199 /// \brief A bipartite graph template class 200 /// 201 /// This class composes a bipartite graph over a directed or undirected 202 /// graph structure of type \c Graph. 203 /// \c _graph have to be a reference to a graph of type \c Graph 204 /// and \c _s_false_t_true_map is an \c IterableBoolMap 205 /// reference containing the elements for the 206 /// color classes S and T. \c _graph is to be referred to an undirected 207 /// graph or a directed graph with edges oriented from S to T. 208 /// 209 ///\bug experimental. Do not use this while the bipartitemap augmentation 205 210 /// does not work well. 206 211 template<typename Graph> … … 271 276 // } 272 277 273 /// experimentral, do not try it. 274 /// It eats a bipartite graph, oriented from S to T. 275 /// Such one can be made e.g. by the above wrapper. 278 /// \brief A wrapper for adding extra nodes s and t to a bipartite graph 279 /// and edges from s to each node of S and form each node of T to t. 280 /// 281 /// A wrapper for adding extra nodes s and t to a bipartite graph 282 /// and edges from s to each node of S and form each node of T to t. 283 /// This class is very useful to reduce some matching or more 284 /// generally, capacitataed bmatching problem to a flow problem. 285 /// According to the bipartite graph concepts the bipartite 286 /// graph have to be oriented from S to T. 276 287 /// 277 /// \author Marton Makai288 /// \author Marton Makai 278 289 template<typename Graph> 279 290 class stGraphWrapper : public GraphWrapper<Graph> {
Note: See TracChangeset
for help on using the changeset viewer.