lgf-gen.cc File Reference

---

Detailed Description

Graph generator application for various types of plane graphs.

    Usage:
      ./tools/lgf-gen [-2con|-tree|-tsp|-tsp2|-dela] [-disc|-square|-gauss]
         [-rand|-seed int] [--help|-h|-help] [-area num] [-cities int] [-dir]
         [-eps] [-g int] [-n int] [prefix]
    Where:
      [prefix]
         Prefix of the output files. Default is 'lgf-gen-out'
      --help|-h|-help
         Print a short help message
      -2con
         Create a two connected planar graph
      -area num
         Full relative area of the cities (default is 1)
      -cities int
         Number of cities (default is 1)
      -dela
         Delaunay triangulation graph
      -dir
         Directed graph is generated (each edges are replaced by two directed ones)
      -disc
         Nodes are evenly distributed on a unit disc (default)
      -eps
         Also generate .eps output (prefix.eps)
      -g int
         Girth parameter (default is 10)
      -gauss
         Nodes are located according to a two-dim gauss distribution
      -n int
         Number of nodes (default is 100)
      -rand
         Use time seed for random number generator
      -seed int
         Random seed
      -square
         Nodes are evenly distributed on a unit square
      -tree
         Create a min. cost spanning tree
      -tsp
         Create a TSP tour
      -tsp2
         Create a TSP tour (tree based)
   

#include <lemon/list_graph.h>
#include <lemon/graph_utils.h>
#include <lemon/random.h>
#include <lemon/dim2.h>
#include <lemon/bfs.h>
#include <lemon/counter.h>
#include <lemon/suurballe.h>
#include <lemon/graph_to_eps.h>
#include <lemon/graph_writer.h>
#include <lemon/arg_parser.h>
#include <lemon/euler.h>
#include <lemon/math.h>
#include <algorithm>
#include <lemon/kruskal.h>
#include <lemon/time_measure.h>