# HG changeset patch
# User marci
# Date 1084206741 0
# Node ID 1faa5bec1717d4b300998958e51854a854d376c4
# Parent  a6e2b02f496a254ce413eee1e91084744c19ae89
complete graphs

diff -r a6e2b02f496a -r 1faa5bec1717 src/work/jacint/graph_gen.h
--- a/src/work/jacint/graph_gen.h	Mon May 10 16:31:48 2004 +0000
+++ b/src/work/jacint/graph_gen.h	Mon May 10 16:32:21 2004 +0000
@@ -62,7 +62,7 @@
   }
 
   /// Generates a complete graph in the undirected sense 
-  /// with n nodes and m edges.
+  /// with n nodes.
   /// Before generating the random graph, \c g.clear() is called.
   template<typename Graph>
   void completeGraph(Graph& g, int n) {
@@ -74,5 +74,39 @@
       for (int j=i+1; j<n; ++j)
 	g.addEdge(nodes[i], nodes[j]);
   }
+
+  /// Generates a complete bidirected graph on n nodes.
+  /// Before generating the random graph, \c g.clear() is called.
+  template<typename Graph>
+  void completeBidirectedGraph(Graph& g, int n) {
+    g.clear();
+    std::vector<typename Graph::Node> nodes;
+    for (int i=0; i<n; ++i)
+      nodes.push_back(g.addNode());
+    for (int i=0; i<n; ++i) 
+      for (int j=i+1; j<n; ++j) {
+	g.addEdge(nodes[i], nodes[j]);	
+	g.addEdge(nodes[j], nodes[i]);
+      }
+  }
+
+  /// Generates a complete bipartite graph with a and b nodes 
+  /// in the color classes.
+  /// Before generating the random graph, \c g.clear() is called.
+  template<typename Graph>
+  void completeBipartiteGraph(Graph& g, int a, int b) {
+    g.clear();
+    std::vector<typename Graph::Node> s_nodes;
+    std::vector<typename Graph::Node> t_nodes;
+    for (int i=0; i<a; ++i)
+      ///\bug g.addNode(g.S_CLASS) would be better.
+      s_nodes.push_back(g.addNode(false));
+    for (int i=0; i<b; ++i)
+      ///\bug g.addNode(g.T_CLASS) would be better.
+      t_nodes.push_back(g.addNode(true));
+    for (int i=0; i<a; ++i) 
+      for (int j=0; j<b; ++j)       
+	g.addEdge(s_nodes[i], t_nodes[j]);
+  }
   
 } //namespace hugo