deba@1210: #include <iostream>
deba@1210: #include <vector>
deba@1210: 
deba@1210: #include <cmath>
deba@1210: #include <cstdlib>
deba@1210: 
deba@1210: #include <lemon/smart_graph.h>
deba@1210: #include <lemon/graph_writer.h>
deba@1210: 
deba@1210: using namespace lemon;
deba@1210: using namespace std;
deba@1210: 
deba@1210: int main(int argc, const char *argv[]) {
deba@1210:   typedef SmartGraph Graph;
deba@1210:   typedef Graph::Node Node;
deba@1210:   typedef Graph::Edge Edge;
deba@1210: 
deba@1210:   typedef Graph::EdgeMap<int> CapacityMap;
deba@1210: 
deba@1210:   const int n = argc > 1 ? atoi(argv[1]) : 1000;
deba@1210:   const int e = argc > 2 ? atoi(argv[2]) : (int)(n * log(n));
deba@1210:   const int m = argc > 3 ? atoi(argv[3]) : 100;
deba@1210: 
deba@1210:   Graph graph;
deba@1210:   CapacityMap capacity(graph);
deba@1210:   vector<Node> nodes;
deba@1210: 
deba@1210:   for (int i = 0; i < n; ++i) {
deba@1210:     nodes.push_back(graph.addNode());
deba@1210:   }
deba@1210:   for (int i = 0; i < e; ++i) {
deba@1210:     int s = (int)(n * (double)rand() / (RAND_MAX + 1.0));
deba@1210:     int t = (int)(n * (double)rand() / (RAND_MAX + 1.0));
deba@1210:     int c = (int)(m * (double)rand() / (RAND_MAX + 1.0));
deba@1210:     Edge edge = graph.addEdge(nodes[s], nodes[t]);
deba@1210:     capacity[edge] = c;
deba@1210:   }
deba@1210:   int start = (int)(n * (double)rand() / (RAND_MAX + 1.0));
deba@1210:   writeGraph(cout, graph, capacity, nodes[start]);
deba@1210:   return 0;
deba@1210: }