Changeset 598:1faa5bec1717 in lemon-0.x for src/work/jacint

Timestamp:

05/10/04 18:32:21 (21 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@778

Message:

complete graphs

File:

• src/work/jacint/graph_gen.h (modified) (2 diffs)

src/work/jacint/graph_gen.h

@@ -63 +63 @@
 
   /// 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>
@@ -75 +75 @@
         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