Dip
0.92.4
Main Page
Related Pages
Modules
Namespaces
Classes
Files
File List
File Members
tmp
Dip-0.92.4
SYMPHONY
Applications
MPP
include
mpp.h
Go to the documentation of this file.
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 Mixed Postman Problem. */
6
/* */
7
/* (c) Copyright 2005-2008 Lehigh University. All Rights Reserved. */
8
/* */
9
/* This application was originally developed by Andrew Hofmann and was */
10
/* modified by Ted Ralphs (ted@lehigh.edu) */
11
/* */
12
/* This software is licensed under the Eclipse Public License. Please see */
13
/* accompanying file for terms. */
14
/* */
15
/*===========================================================================*/
16
17
#ifndef _MPP_H
18
#define _MPP_H
19
20
/* Cut types */
21
22
#define ODD_CUT 1
23
24
/*---------------------------------------------------------------------------*\
25
* Use this data structure to store the value of any run-time parameters.
26
\*---------------------------------------------------------------------------*/
27
28
typedef
struct
MPP_PARAMETERS
{
29
/* Name of file containingthe instance data */
30
char
infile
[
MAX_FILE_NAME_LENGTH
+ 1];
31
int
test
;
32
char
test_dir
[
MAX_FILE_NAME_LENGTH
+1];
/* Test files directory */
33
}
mpp_parameters
;
34
35
/*---------------------------------------------------------------------------*\
36
* Use this data structure to store the instance data after it is read in.
37
\*---------------------------------------------------------------------------*/
38
39
typedef
struct
MPP_PROBLEM
{
40
mpp_parameters
par
;
/* the parameters */
41
int
numnodes
;
/* the number of nodes in the graph */
42
int
numedges
;
/* number of edges in the graph */
43
int
numarcs
;
/* number of arcs in the graph */
44
int
*
cost
;
/* an array containing the costs */
45
int
*
head
;
/* an array containing the head of each arc/edge*/
46
int
*
tail
;
/* an array containing the tail of each arc/edge*/
47
char
*
type
;
/* an array containing the variable types */
48
int
*
is_odd
;
/* array containing a 1 if odd 0 if not*/
49
int
odd_checker
;
/*indicates if odds have been checked */
50
}
mpp_problem
;
51
52
#endif
MPP_PROBLEM::numarcs
int numarcs
Definition:
mpp.h:43
MPP_PROBLEM::cost
int * cost
Definition:
mpp.h:44
MPP_PARAMETERS::infile
char infile[MAX_FILE_NAME_LENGTH+1]
Definition:
mpp.h:30
MPP_PROBLEM::numedges
int numedges
Definition:
mpp.h:42
MPP_PARAMETERS
Definition:
mpp.h:28
MPP_PROBLEM::numnodes
int numnodes
Definition:
mpp.h:41
MAX_FILE_NAME_LENGTH
#define MAX_FILE_NAME_LENGTH
Definition:
sym_proto.h:18
MPP_PROBLEM
Definition:
mpp.h:39
MPP_PROBLEM::is_odd
int * is_odd
Definition:
mpp.h:48
mpp_parameters
struct MPP_PARAMETERS mpp_parameters
MPP_PROBLEM::head
int * head
Definition:
mpp.h:45
MPP_PARAMETERS::test_dir
char test_dir[MAX_FILE_NAME_LENGTH+1]
Definition:
mpp.h:32
MPP_PROBLEM::par
mpp_parameters par
Definition:
mpp.h:40
mpp_problem
struct MPP_PROBLEM mpp_problem
MPP_PROBLEM::tail
int * tail
Definition:
mpp.h:46
MPP_PROBLEM::odd_checker
int odd_checker
Definition:
mpp.h:49
MPP_PROBLEM::type
char * type
Definition:
mpp.h:47
MPP_PARAMETERS::test
int test
Definition:
mpp.h:31
Generated by
1.8.5