assign.cc 18 KB
Newer Older
Robert Ricci's avatar
Robert Ricci committed
1 2 3 4 5 6
/*
 * EMULAB-COPYRIGHT
 * Copyright (c) 2000-2003 University of Utah and the Flux Group.
 * All rights reserved.
 */

7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
#include "port.h"

#include <hash_map>
#include <rope>
#include <queue>

#include <boost/config.hpp>
#include <boost/utility.hpp>
#include <boost/property_map.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <boost/graph/graphviz.hpp>

#include <fstream.h>
Mac Newbold's avatar
Mac Newbold committed
22
#include <iostream.h>
23
#include <time.h>
Mac Newbold's avatar
Mac Newbold committed
24
#include <stdlib.h>
25
#include <math.h>
Mac Newbold's avatar
Mac Newbold committed
26 27
#include <sys/types.h>
#include <sys/time.h>
28 29 30
#include <sys/resource.h>

using namespace boost;
Mac Newbold's avatar
Mac Newbold committed
31 32

#include "common.h"
33
#include "delay.h"
Mac Newbold's avatar
Mac Newbold committed
34
#include "physical.h"
35
#include "virtual.h"
36
#include "vclass.h"
37
#include "pclass.h"
38
#include "score.h"
39 40 41
#include "solution.h"
#include "maps.h"
#include "anneal.h"
42 43 44

// Here we set up all our graphs.  Need to create the graphs
// themselves and then setup the property maps.
45
tb_pgraph PG;
46 47 48 49 50 51 52 53 54 55
tb_pgraph_vertex_pmap pvertex_pmap = get(vertex_data, PG);
tb_pgraph_edge_pmap pedge_pmap = get(edge_data, PG);
tb_sgraph SG;
tb_sgraph_vertex_pmap svertex_pmap = get(vertex_data, SG);
tb_sgraph_edge_pmap sedge_pmap = get(edge_data, SG);
tb_vgraph VG;
tb_vgraph_vertex_pmap vvertex_pmap = get(vertex_data, VG);
tb_vgraph_edge_pmap vedge_pmap = get(edge_data, VG);

// A simple list of physical types.
56
name_count_map ptypes;
57 58

// List of virtual types by name.
59
name_count_map vtypes;
60 61

// A list of all pclasses.
62
pclass_list pclasses;
63 64 65
 	
// Map from a pnode* to the the corresponding pvertex.
pnode_pvertex_map pnode2vertex;
66 67 68

// Map of a type to a tt_entry, a vector of pclasses and the size of
// the vector.
69
pclass_types type_table;
70 71 72
#ifdef PER_VNODE_TT
pclass_types vnode_type_table;
#endif
73

74 75 76 77 78
// This datastructure contains all the information needed to calculate
// the shortest path between any two switches.  Indexed by svertex,
// the value will be a predicate map (indexed by svertex as well) of
// the shortest paths for the given vertex.
switch_pred_map_map switch_preds;
79

80 81
// Same, but for distances 
switch_dist_map_map switch_dist;
Christopher Alfeld's avatar
 
Christopher Alfeld committed
82

83 84
// Time started, finished, and the time limit
double timestart, timeend, timelimit, timetarget;
85

86 87 88 89 90
#ifdef GNUPLOT_OUTPUT
FILE *scoresout, *tempout, *deltaout;
#endif
// Whether or not assign is allowed to generate trivial links
bool allow_trivial_links = true;
91

92
// Whether or not assign should use pclasses
93
bool disable_pclasses = false;
94

Robert Ricci's avatar
Robert Ricci committed
95 96 97
// Whether or not assign should prune out pclasses that it knows can
// never be used
bool prune_pclasses = false;
98 99 100 101
  
// XXX - shouldn't be in this file
double absbest;
int absbestviolated, iters, iters_to_best;
Robert Ricci's avatar
Robert Ricci committed
102

103 104 105
/*
 * Internal functions
 */
Mac Newbold's avatar
Mac Newbold committed
106

Robert Ricci's avatar
Robert Ricci committed
107
// Return the CPU time (in seconds) used by this process
108 109 110 111 112 113 114 115
float used_time()
{
  struct rusage ru;
  getrusage(RUSAGE_SELF,&ru);
  return ru.ru_utime.tv_sec+ru.ru_utime.tv_usec/1000000.0+
    ru.ru_stime.tv_sec+ru.ru_stime.tv_usec/1000000.0;
}

Robert Ricci's avatar
Robert Ricci committed
116
// Read in the .ptop file
117 118 119 120
void read_physical_topology(char *filename)
{
  ifstream ptopfile;
  ptopfile.open(filename);
Robert Ricci's avatar
Robert Ricci committed
121 122 123 124
  if (!ptopfile.is_open()) {
      cerr << "Unable to open ptop file " << filename << endl;
      exit(2);
  }
125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147
  cout << "Physical Graph: " << parse_ptop(PG,SG,ptopfile) << endl;

#ifdef DUMP_GRAPH
  {
    cout << "Physical Graph:" << endl;
    
    pvertex_iterator vit,vendit;
    tie(vit,vendit) = vertices(PG);
    
    for (;vit != vendit;vit++) {
      tb_pnode *p = get(pvertex_pmap,*vit);
      cout << *vit << "\t" << *p;
    }
    
    pedge_iterator eit,eendit;
    tie(eit,eendit) = edges(PG);

    for (;eit != eendit;eit++) {
      tb_plink *p = get(pedge_pmap,*eit);
      cout << *eit << " (" << source(*eit,PG) << " <-> " <<
	target(*eit,PG) << ")\t" << *p;
    }
  }
Robert Ricci's avatar
Robert Ricci committed
148
#endif // DUMP_GRAPH
149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171

#ifdef GRAPH_DEBUG
  {
    cout << "Switch Graph:" << endl;
    

    svertex_iterator vit,vendit;
    tie(vit,vendit) = vertices(SG);
    
    for (;vit != vendit;vit++) {
      tb_switch *p = get(svertex_pmap,*vit);
      cout << *vit << "\t" << *p;
    }
    
    sedge_iterator eit,eendit;
    tie(eit,eendit) = edges(SG);

    for (;eit != eendit;eit++) {
      tb_slink *p = get(sedge_pmap,*eit);
      cout << *eit << " (" << source(*eit,SG) << " <-> " <<
	target(*eit,SG) << ")\t" << *p;
    }
  }
Robert Ricci's avatar
Robert Ricci committed
172
#endif // GRAPH_DEBUG
173

Robert Ricci's avatar
Robert Ricci committed
174 175
  // Set up pnode2vertex - a mapping between vertices in the physical graph and
  // the pnodes that we just read in from the ptop file
176 177 178 179 180 181 182 183
  pvertex_iterator pvit,pvendit;
  tie(pvit,pvendit) = vertices(PG);
  for (;pvit != pvendit;pvit++) {
    pnode2vertex[get(pvertex_pmap,*pvit)]=*pvit;
  }

}

Robert Ricci's avatar
Robert Ricci committed
184 185
// Calculate the minimum spanning tree for the switches - we only consider one
// potential path between each pair of switches.
186
void calculate_switch_MST()
Christopher Alfeld's avatar
 
Christopher Alfeld committed
187
{
188
  cout << "Calculating shortest paths on switch fabric." << endl;
Robert Ricci's avatar
Robert Ricci committed
189 190

  // Set up the weight map for Dijkstra's
191 192 193 194 195 196 197 198 199 200
  tb_sgraph_weight_pmap sweight_pmap = get(edge_weight, SG);
  sedge_iterator seit,seendit;
  tie(seit,seendit) = edges(SG);
  for (;seit != seendit;seit++) {
    tb_slink *slink = get(sedge_pmap,*seit);
    // XXX should we make this more complicated depending on
    // latency/loss as well?
    put(sweight_pmap,*seit,
	100000000-get(pedge_pmap,slink->mate)->delay_info.bandwidth);
  }
Christopher Alfeld's avatar
 
Christopher Alfeld committed
201

Robert Ricci's avatar
Robert Ricci committed
202
  // Let boost do the Disjktra's for us, from each switch
203 204 205 206 207 208 209 210
  svertex_iterator svit,svendit;
  tie(svit,svendit) = vertices(SG);
  for (;svit != svendit;svit++) {
    switch_preds[*svit] = new switch_pred_map(num_vertices(SG));
    switch_dist[*svit] = new switch_dist_map(num_vertices(SG));
    dijkstra_shortest_paths(SG,*svit,
    			    predecessor_map(&((*switch_preds[*svit])[0])).
			    distance_map(&((*switch_dist[*svit])[0])));
Christopher Alfeld's avatar
 
Christopher Alfeld committed
211 212
  }

213 214 215 216 217 218 219 220 221
#ifdef GRAPH_DEBUG
  cout << "Shortest paths" << endl;
  tie(svit,svendit) = vertices(SG);
  for (;svit != svendit;svit++) {
    cout << *svit << ":" << endl;
    for (unsigned int i = 0;i<num_vertices(SG);++i) {
      cout << i << " " << (*switch_dist[*svit])[i] << endl;
    }
  }
Robert Ricci's avatar
Robert Ricci committed
222
#endif // GRAPH_DEBUG
223 224
}

Robert Ricci's avatar
Robert Ricci committed
225
// Read in the .top file
226 227 228 229
void read_virtual_topology(char *filename)
{
  ifstream topfile;
  topfile.open(filename);
Robert Ricci's avatar
Robert Ricci committed
230 231 232 233
  if (!topfile.is_open()) {
      cerr << "Unable to open top file " << filename << endl;
      exit(2);
  }
234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259
  cout << "Virtual Graph: " << parse_top(VG,topfile) << endl;

#ifdef DUMP_GRAPH
  {
    cout << "Virtual Graph:" << endl;
    

    vvertex_iterator vit,vendit;
    tie(vit,vendit) = vertices(VG);
    
    for (;vit != vendit;vit++) {
      tb_vnode *p = get(vvertex_pmap,*vit);
      cout << *vit << "\t" << *p;
    }
    
    vedge_iterator eit,eendit;
    tie(eit,eendit) = edges(VG);

    for (;eit != eendit;eit++) {
      tb_vlink *p = get(vedge_pmap,*eit);
      cout << *eit << " (" << source(*eit,VG) << " <-> " <<
	target(*eit,VG) << ")\t" << *p;
    }
  }  
#endif
}
Robert Ricci's avatar
Robert Ricci committed
260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285
/*
 * Make a pass through the pclasses, looking for ones that no node can use, and
 * nuking them.
 */
void prune_unusable_pclasses() {
    cout << "Pruning pclasses." << endl;
    int pruned = 0;
    pclass_list::iterator pclass_iterator = pclasses.begin();
    while (pclass_iterator != pclasses.end()) {
	if ((*pclass_iterator)->refcount == 0) {
	    pclass_list::iterator nukeme = pclass_iterator;
	    pclass_iterator++;
#ifdef PCLASS_DEBUG
	    cout << "Pruning " << (*nukeme)->name << endl;
#endif
	    pruned++;
	    delete *nukeme;
	    pclasses.erase(nukeme);
	} else {
	    pclass_iterator++;
	}
    }
    cout << "pclass pruning complete: removed " << pruned << " pclasses, " <<
	pclasses.size() << " remain." << endl;
}

286
void print_help()
287
{
288 289 290 291
  cerr << "assign [options] ptopfile topfile [config params]" << endl;
  cerr << "Options: " << endl;
#ifdef TIME_TERMINATE
  cerr << "  -l <time>   - Limit runtime." << endl;
Mac Newbold's avatar
Mac Newbold committed
292
#endif
293 294 295 296 297 298 299
  cerr << "  -s <seed>   - Set the seed." << endl;
  cerr << "  -v <viz>    - Produce graphviz files with given prefix." <<
    endl;
  cerr << "  -r          - Don't allow trivial links." << endl;
  cerr << "  -p          - Disable pclasses." << endl;
#ifdef PER_VNODE_TT
  cerr << "  -P          - Prune unusable pclasses." << endl;
300
#endif
301
  cerr << "  -T          - Doing some scoring self-testing." << endl;
302 303 304 305 306 307 308 309
  exit(2);
}
 
// Perfrom a pre-cehck to make sure that there are enough free nodes of the
// proper types. Returns 1 if the proper types exist, 0 if they do not.
// TODO - move away from using global variables
int type_precheck() {
    cout << "Type precheck:" << endl;
310

311
    bool ok = true;
Mac Newbold's avatar
Mac Newbold committed
312

313 314 315 316 317 318 319 320 321
    for (name_count_map::iterator vtype_it=vtypes.begin();
	    vtype_it != vtypes.end();++vtype_it) {
    
	// Check to see if there were any pnodes of the type at all
	name_count_map::iterator ptype_it = ptypes.find(vtype_it->first);
	if (ptype_it == ptypes.end()) {
	    cerr << "  *** No physical nodes of type " << vtype_it->first
		<< " found" << endl;
	    ok = false;
322
	} else {
323 324 325 326 327 328 329
	    // Okay, there are some - are there enough?
	    if (ptype_it->second < vtype_it->second) {
		cerr << "  *** " << vtype_it->second << " nodes of type " <<
		    vtype_it->first << " requested, but only "
		    << ptype_it->second << " found" << endl;
		ok = false;
	    }
330
	}
331 332 333 334 335 336 337 338 339
    }
    if (ok) {
      cout << "Type preecheck passed." << endl;
      return 1;
    } else {
      cout << "Type precheck failed!" << endl;
      return 0;
    }
}
340

341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356
// Perfrom a pre-cehck to make sure that every vnode has at least one possible
// mapping.  Returns 1 if this is the case, 0 if not.
// TODO - move away from using global variables
int mapping_precheck() {
#ifdef PER_VNODE_TT
    cout << "Node mapping precheck:" << endl;
    /*
     * Build up an entry in the type table for each vnode, by first looking at
     * the type table entry for the vnode's type, then checking each entry to
     * make sure that it:
     * (1) Has enough interfaces
     * (2) Has enough total bandwidth (for emulated links)
     * (3) Meets any 1.0-weight features and/or desires
     */
    vvertex_iterator vit,vendit;
    tie(vit,vendit) = vertices(VG);
357

358 359 360 361
    /*
     * Indicates whether all nodes have potential matches or not
     */
    bool ok = true;
362

363 364
    for (;vit != vendit;vit++) {
	tb_vnode *v = get(vvertex_pmap,*vit);
365

366 367 368 369 370 371 372 373 374 375 376 377 378 379 380
	pclass_vector *vec = new pclass_vector();
	vnode_type_table[v->name] = tt_entry(0,vec);

	// This constitutes a list of the number of ptypes that matched the
	// criteria. We use to guess what's wrong with the vnode.
	int matched_links = 0;
	int matched_bw = 0;
	// Keep track of desires had how many 'hits', so that we can tell
	// if any simply were not matched
	tb_vnode::desires_count_map matched_desires;

	tb_vclass *vclass = v->vclass;
	tb_vclass::members_map::iterator mit;
	if (vclass) {
	    mit = vclass->members.begin();
381
	}
382 383 384 385 386 387 388 389 390
	for (;;) {
	    // Loop over all types this node can take on, which might be only
	    // one, if it's not part of a vclass
	    crope this_type;
	    if (vclass) {
		this_type = mit->first;
	    } else {
		this_type = v->type;
	    }
391

392 393
	    for (pclass_vector::iterator it = type_table[this_type].second->begin();
		    it != type_table[this_type].second->end(); it++) {
394

395 396 397
		bool potential_match = true;
		// Grab the first node of the pclass as a representative sample
		tb_pnode *pnode = *((*it)->members[this_type]->L.begin());
Mac Newbold's avatar
Mac Newbold committed
398

399 400 401 402 403 404
		// Check the number of interfaces - if the pnode is a switch,
		// for now, we don't check this, since it can end up with more
		// 'interfaces' due to the fact that it can have interswitch
		// links
		if ((pnode->total_interfaces >= v->num_links) ||
			pnode->current_type.compare("switch")) {
405 406 407 408
		    matched_links++;
		} else {
		    potential_match = false;
		}
Mac Newbold's avatar
Mac Newbold committed
409

410 411 412 413 414 415
		// Check bandwidth on emulated links
		if (pnode->total_bandwidth >= v->total_bandwidth) {
		    matched_bw++;
		} else {
		    potential_match = false;
		}
Mac Newbold's avatar
Mac Newbold committed
416

417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441
		//
		// Check features and desires
		//

		// Desires first
		for (tb_vnode::desires_map::iterator desire_it = v->desires.begin();
			desire_it != v->desires.end();
			desire_it++) {
		    crope name = (*desire_it).first;
		    float value = (*desire_it).second;
		    // Only check for desires that would result in a violation if
		    // unsatisfied
		    if (value >= FD_VIOLATION_WEIGHT) {
			if (matched_desires.find(name) == matched_desires.end()) {
			    matched_desires[name] = 0;
			}
			tb_pnode::features_map::iterator feature_it =
			    pnode->features.find(name);
			if (feature_it != pnode->features.end()) {
			    matched_desires[name]++;
			} else {
			    potential_match = false;
			}
		    }
		}
Mac Newbold's avatar
Mac Newbold committed
442

443 444 445 446 447 448 449 450 451 452 453 454 455 456 457
		// Next, features
		for (tb_pnode::features_map::iterator feature_it = pnode->features.begin();
			feature_it != pnode->features.end(); feature_it++) {
		    crope name = (*feature_it).first;
		    float value = (*feature_it).second;
		    // Only check for feature that would result in a violation if
		    // undesired
		    if (value >= FD_VIOLATION_WEIGHT) {
			tb_vnode::desires_map::iterator desire_it =
			    v->desires.find(name);
			if (desire_it == v->desires.end()) {
			    potential_match = false;
			}
		    }
		}
458

Mac Newbold's avatar
Mac Newbold committed
459

460 461 462 463 464 465
		if (potential_match) {
		    vec->push_back(*it);
		    vnode_type_table[v->name].first++;
		    (*it)->refcount++;
#ifdef PCLASS_DEBUG
		    cerr << v->name << " can map to " << (*it)->name << endl;
466
#endif
467 468
		}
	    }
469

470 471 472 473 474 475 476 477 478
	    if (vclass) { 
		mit++;
		if (mit == vclass->members.end()) {
		    break;
		}
	    } else {
		// If not a vtype, we only had to do this once
		break;
	    }
479
	}
480

481 482 483 484 485 486
	if (vnode_type_table[v->name].first == 0) {
	    cerr << "  *** No possible mapping for " << v->name << endl;
	    // Make an attempt to figure out why it didn't match
	    if (!matched_links) {
		cerr << "      Too many links!" << endl;
	    }
487

488 489 490
	    if (!matched_bw) {
		cerr << "      Too much bandwidth on emulated links!" << endl;
	    }
491

492 493 494 495 496 497 498
	    for (tb_vnode::desires_count_map::iterator dit = matched_desires.begin();
		    dit != matched_desires.end();
		    dit++) {
		if (dit->second == 0) {
		    cerr << "      No physical nodes have feature " << dit->first
			<< "!" << endl;
		}
499
	    }
500
	    ok = false;
501
	}
502 503 504
#ifdef PCLASS_DEBUG
	cerr << v->name << " can map to " << vnode_type_table[v->name].first << " pclasses"
	    << endl;
505
#endif
506

507
    }
508

509 510 511
    if (ok) {
	cout << "Node mapping precheck succeeded" << endl;
	return 1;
512
    } else {
513 514
	cout << "Node mapping precheck failed!" << endl;
	return 0;
515 516
    }

517 518 519
#else // PER_VNODE_TT
    // PER_VNODE_TT is required for this check, just pretend it's OK.
    return 1;
Robert Ricci's avatar
Robert Ricci committed
520
#endif
521
}
Christopher Alfeld's avatar
 
Christopher Alfeld committed
522

523 524 525 526
int main(int argc,char **argv)
{
  int seed = 0;
  crope viz_prefix;
527
  bool scoring_selftest = false;
528 529 530 531 532
  
  // Handle command line
  char ch;
  timelimit = 0.0;
  timetarget = 0.0;
Robert Ricci's avatar
Robert Ricci committed
533
  while ((ch = getopt(argc,argv,"s:v:l:t:rpP")) != -1) {
534 535 536 537
    switch (ch) {
    case 's':
      if (sscanf(optarg,"%d",&seed) != 1) {
	print_help();
538
      }
539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555
      break;
    case 'v':
      viz_prefix = optarg;
      break;
#ifdef TIME_TERMINATE
    case 'l':
      if (sscanf(optarg,"%lf",&timelimit) != 1) {
	print_help();
      }
      break;
#endif
#ifdef TIME_TARGET
    case 't':
      if (sscanf(optarg,"%lf",&timetarget) != 1) {
	print_help();
      }
      break;
556
#endif
557 558 559
    case 'r':
      allow_trivial_links = false; break;
    case 'p':
560
      disable_pclasses = true; break;
Robert Ricci's avatar
Robert Ricci committed
561 562 563 564
#ifdef PER_VNODE_TT
    case 'P':
      prune_pclasses = true; break;
#endif
565 566
    case 'T':
      scoring_selftest = true; break;
567 568
    default:
      print_help();
569
    }
570
  }
571 572 573 574 575 576 577 578 579
  argc -= optind;
  argv += optind;
  
  if (seed == 0) {
    if (getenv("ASSIGN_SEED") != NULL) {
      sscanf(getenv("ASSIGN_SEED"),"%d",&seed);
    } else {
      seed = time(NULL)+getpid();
    }
580
  }
581 582 583 584

  if (viz_prefix.size() == 0) {
    if (getenv("ASSIGN_GRAPHVIZ") != NULL) {
      viz_prefix = getenv("ASSIGN_GRAPHVIZ");
585
    }
586
  }
Mac Newbold's avatar
Mac Newbold committed
587

588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610
  if (argc == 0) {
    print_help();
  }

  // Convert options to the common.h parameters.
  parse_options(argv, options, noptions);
#ifdef SCORE_DEBUG
  dump_options("Configuration options:", options, noptions);
#endif

#ifdef GNUPLOT_OUTPUT
  scoresout = fopen("scores.out","w");
  tempout = fopen("temp.out","w");
  deltaout = fopen("delta.out","w");
#endif

  cout << "seed = " << seed << endl;
  std::srandom(seed);

  read_physical_topology(argv[0]);
  calculate_switch_MST();
  
  cout << "Generating physical equivalence classes:";
611
  generate_pclasses(PG,disable_pclasses);
612
  cout << pclasses.size() << endl;
613

614 615 616
#ifdef PCLASS_DEBUG
  pclass_debug();
#endif
617 618

  read_virtual_topology(argv[1]);
619

620 621
  // Run the type precheck
  if (!type_precheck()) {
Robert Ricci's avatar
Robert Ricci committed
622
      exit(2);
623
  }
624

625 626
  // Run the mapping precheck
  if (!mapping_precheck()) {
Robert Ricci's avatar
Robert Ricci committed
627
      exit(2);
628
  }
Robert Ricci's avatar
Robert Ricci committed
629

630
#ifdef PER_VNODE_TT
Robert Ricci's avatar
Robert Ricci committed
631 632 633
  if (prune_pclasses) {
      prune_unusable_pclasses();
  }
634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653
#endif

  // Output graphviz if necessary
  if (viz_prefix.size() != 0) {
    crope vviz = viz_prefix + "_virtual.viz";
    crope pviz = viz_prefix + "_physical.viz";
    crope sviz = viz_prefix + "_switch.viz";
    ofstream vfile,pfile,sfile;
    vfile.open(vviz.c_str());
    write_graphviz(vfile,VG,vvertex_writer(),vedge_writer(),graph_writer());
    vfile.close();
    pfile.open(pviz.c_str());
    write_graphviz(pfile,PG,pvertex_writer(),pedge_writer(),graph_writer());
    pfile.close();
    sfile.open(sviz.c_str());
    write_graphviz(sfile,SG,svertex_writer(),sedge_writer(),graph_writer());
    sfile.close();
  }
 
  timestart = used_time();
654
  anneal(scoring_selftest);
655
  timeend = used_time();
656

657 658 659 660 661 662
#ifdef GNUPLOT_OUTPUT
  fclose(scoresout);
  fclose(tempout);
  fclose(deltaout);
#endif

663
  if ((get_score() > absbest) || (violated > absbestviolated)) {
664
    cerr << "Internal error: Invalid migration assumptions." << endl;
665
    cerr << "score:" << get_score() << " absbest:" << absbest <<
666 667 668 669
      " violated:" << violated << " absbestviolated:" <<
      absbestviolated << endl;
    cerr << "  Contact calfeld" << endl;
  }
670
  
671
  cout << "   BEST SCORE:  " << get_score() << " in " << iters <<
672 673 674 675
    " iters and " << timeend-timestart << " seconds" << endl;
  cout << "With " << violated << " violations" << endl;
  cout << "Iters to find best score:  " << iters_to_best << endl;
  cout << "Violations: " << violated << endl;
676
  cout << vinfo;
677

678
  print_solution();
679 680 681 682 683 684 685 686 687 688 689

  if (viz_prefix.size() != 0) {
    crope aviz = viz_prefix + "_solution.viz";
    ofstream afile;
    afile.open(aviz.c_str());
    write_graphviz(afile,VG,solution_vertex_writer(),
		   solution_edge_writer(),graph_writer());
    afile.close();
  }
  
  if (violated > 0) {
Robert Ricci's avatar
Robert Ricci committed
690
      return 1;
691 692 693
  } else {
      return 0;
  }
694
}
695