| 1 |
/*===========================================================================*/ |
| 2 |
/* */ |
| 3 |
/* This file is part of a demonstration application for use with the */ |
| 4 |
/* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ |
| 5 |
/* the Vehicle Routing Problem and the Traveling Salesman Problem. */ |
| 6 |
/* */ |
| 7 |
/* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ |
| 8 |
/* */ |
| 9 |
/* This application was developed by Ted Ralphs ([email protected]) */ |
| 10 |
/* */ |
| 11 |
/* This software is licensed under the Eclipse Public License. Please see */ |
| 12 |
/* accompanying file for terms. */ |
| 13 |
/* */ |
| 14 |
/*===========================================================================*/ |
| 15 |
|
| 16 |
#ifndef _VRP_DG_FUNCTIONS_H |
| 17 |
#define _VRP_DG_FUNCTIONS_H |
| 18 |
|
| 19 |
/* SYMPHONY include files */ |
| 20 |
#include "sym_proto.h" |
| 21 |
|
| 22 |
/* CNRP include files */ |
| 23 |
#include "vrp_common_types.h" |
| 24 |
|
| 25 |
void init_window PROTO((int dg_id, char *name, int width, int height)); |
| 26 |
void wait_for_click PROTO((int dg_id, char *name, int report)); |
| 27 |
void display_graph PROTO((int dg_id, char *name)); |
| 28 |
void copy_node_set PROTO((int dg_id, int clone, char *name)); |
| 29 |
void disp_vrp_tour PROTO((int dg_id, int clone, char *name, |
| 30 |
_node *tour, int vertnum, int numroutes,int report)); |
| 31 |
void draw_edge_set_from_edge_data PROTO((int dg_id, char *name, |
| 32 |
int edgenum, edge_data *edges)); |
| 33 |
void draw_edge_set_from_userind PROTO((int dg_id, char *name, |
| 34 |
int edgenum, int *userind)); |
| 35 |
void draw_weighted_edge_set PROTO((int dg_id, char *name, |
| 36 |
int edgenum, int *userind, |
| 37 |
double *value, double etol)); |
| 38 |
void display_support_graph PROTO((int dg_id, int clone, char *name, |
| 39 |
int edgenum, int *userind, |
| 40 |
double *value, double etol, int report)); |
| 41 |
void display_compressed_support_graph PROTO((int dg_id, int clone, char *name, |
| 42 |
int edgenum, int *userind, |
| 43 |
double *value, int report)); |
| 44 |
void display_part_tour PROTO((int dg_id, int clone, char *name, int *tour, |
| 45 |
int numroutes, int report)); |
| 46 |
void delete_graph PROTO((int dg_id, char *name)); |
| 47 |
void disp_lb PROTO((int dg_id, int clone, char *name, int *tree, |
| 48 |
struct DBL_EDGE_DATA *best_edges, int vertnum, |
| 49 |
int numroutes, int report)); |
| 50 |
#endif |