| 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 |
/* This application was developed by Ted Ralphs ([email protected]) */ |
| 8 |
/* This file was modified by Ali Pilatin January, 2005 ([email protected]) */ |
| 9 |
/* */ |
| 10 |
/* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ |
| 11 |
/* */ |
| 12 |
/* This software is licensed under the Eclipse Public License. Please see */ |
| 13 |
/* accompanying file for terms. */ |
| 14 |
/* */ |
| 15 |
/*===========================================================================*/ |
| 16 |
|
| 17 |
#ifndef _S_PATH_H |
| 18 |
#define _S_PATH_H |
| 19 |
|
| 20 |
#include "sym_proto.h" |
| 21 |
#include "heur_types.h" |
| 22 |
|
| 23 |
typedef struct ADJ_LIST{ |
| 24 |
int custnum; |
| 25 |
int cost; |
| 26 |
struct ADJ_LIST *next; |
| 27 |
}adj_list; |
| 28 |
|
| 29 |
int *sp PROTO((adj_list **adj, int numnodes, int origin, int dest)); |
| 30 |
void make_routes PROTO((heur_prob *p, _node *tsp_tour, int start, |
| 31 |
best_tours *new_tour)); |
| 32 |
|
| 33 |
#endif |