# HG changeset patch
# User marci
# Date 1082642377 0
# Node ID b2acba449222732dea5380de770ab1904750f559
# Parent  5eceadf9316c5eaef4ca003b910e9209bc5db9f4
misc

diff -r 5eceadf9316c -r b2acba449222 src/work/marci/graph_wrapper.h
--- a/src/work/marci/graph_wrapper.h	Thu Apr 22 13:51:25 2004 +0000
+++ b/src/work/marci/graph_wrapper.h	Thu Apr 22 13:59:37 2004 +0000
@@ -867,13 +867,11 @@
   };
 
   /// A wrapper for composing a bipartite graph.
-  /// \c _graph have to be a reference to an undirected graph \c Graph 
-  /// and 
-  /// \c _s_false_t_true_map is an \c IterableBoolMap 
+  /// \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.
-  /// It results in a directed graph such that the edges are oriented from 
-  /// S to T.
+  /// 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.
   template<typename Graph> 
   class BipartiteGraphWrapper : public GraphWrapper<Graph> {
     typedef IterableBoolMap< typename Graph::NodeMap<int> > SFalseTTrueMap;