From 40225bc45820166eeb19eb805a6ea88e5d7b2dbe Mon Sep 17 00:00:00 2001 From: Alberto Santini Date: Mon, 12 Jun 2017 10:52:43 +0200 Subject: [PATCH] Clean up --- README.md | 2 +- instances/big-random/generator.py | 43 -------------- instances/big-random/graph_list.txt | 90 ----------------------------- 3 files changed, 1 insertion(+), 134 deletions(-) delete mode 100644 instances/big-random/generator.py delete mode 100644 instances/big-random/graph_list.txt diff --git a/README.md b/README.md index f4c0fe2..8527ada 100644 --- a/README.md +++ b/README.md @@ -24,7 +24,7 @@ The various solution algorithms are: ### Folder `instances` This folder contains test instances from the literature. -There are three test sets: `random`, `nsfnet`, and `ring`. +There are four test sets: `random`, `big-random`, `nsfnet`, and `ring`. The instance format is the following: * The first line only has one number `n`, which is the number of vertices in the graph (numbered from `0` to `n-1`) diff --git a/instances/big-random/generator.py b/instances/big-random/generator.py deleted file mode 100644 index 9f72c5b..0000000 --- a/instances/big-random/generator.py +++ /dev/null @@ -1,43 +0,0 @@ -import sys -import random -print ("Script name: %s" % str(sys.argv[0])) -print ("node number: %s" % str(sys.argv[1])) -print ("density: %s" % str(sys.argv[2])) -print ("random seed: %s" % str(sys.argv[3])) -n=int(sys.argv[1]) -p=n/2 -dens=float(sys.argv[2]) -ssd=int(sys.argv[3]) - -random.seed(ssd) -e=0 -edge=[[],[]] -for i in range (n): - for j in range (i+1,n): - if random.random()