COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
03/17/04 17:10:33 (16 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@273
Message:

.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/max_bipartite_matching_demo.cc

    r195 r196  
    55#include <cstdlib>
    66
    7 #include <LEDA/graph.h>
    8 #include <leda_graph_wrapper.h>
     7//#include <LEDA/graph.h>
     8//#include <leda_graph_wrapper.h>
     9#include <list_graph.h>
    910#include <dimacs.h>
    1011#include <time_measure.h>
     
    3940
    4041int main() {
    41   leda::graph g;
    42   typedef LedaGraphWrapper<leda::graph> Graph;
    43   Graph G(g);
     42//   leda::graph g;
     43//   typedef LedaGraphWrapper<leda::graph> Graph;
     44//   Graph G(g);
     45  typedef ListGraph Graph;
     46  Graph G;
    4447
    4548  typedef Graph::Node Node;
     
    6265    t_nodes.push_back(G.addNode());
    6366  }
    64 //   random_init();
    65 //   for(int i=0; i<6; ++i) {
    66 //     G.addEdge(s_nodes[random(4)], t_nodes[random(4)]);
    67 //   }
     67  random_init();
     68  for(int i=0; i<6; ++i) {
     69    G.addEdge(s_nodes[random(4)], t_nodes[random(4)]);
     70  }
    6871 
    69   G.addEdge(s_nodes[2], t_nodes[4-4]);
    70   G.addEdge(s_nodes[2], t_nodes[7-4]);
    71   G.addEdge(s_nodes[2], t_nodes[4-4]);
    72   G.addEdge(s_nodes[3], t_nodes[6-4]);
    73   G.addEdge(s_nodes[3], t_nodes[5-4]);
    74   G.addEdge(s_nodes[3], t_nodes[5-4]);
     72//   G.addEdge(s_nodes[2], t_nodes[4-4]);
     73//   G.addEdge(s_nodes[2], t_nodes[7-4]);
     74//   G.addEdge(s_nodes[2], t_nodes[4-4]);
     75//   G.addEdge(s_nodes[3], t_nodes[6-4]);
     76//   G.addEdge(s_nodes[3], t_nodes[5-4]);
     77//   G.addEdge(s_nodes[3], t_nodes[5-4]);
    7578
    7679
Note: See TracChangeset for help on using the changeset viewer.