1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
|
/* Copyright 2004,2007 ENSEIRB, INRIA & CNRS
**
** This file is part of the Scotch software package for static mapping,
** graph partitioning and sparse matrix ordering.
**
** This software is governed by the CeCILL-C license under French law
** and abiding by the rules of distribution of free software. You can
** use, modify and/or redistribute the software under the terms of the
** CeCILL-C license as circulated by CEA, CNRS and INRIA at the following
** URL: "http://www.cecill.info".
**
** As a counterpart to the access to the source code and rights to copy,
** modify and redistribute granted by the license, users are provided
** only with a limited warranty and the software's author, the holder of
** the economic rights, and the successive licensors have only limited
** liability.
**
** In this respect, the user's attention is drawn to the risks associated
** with loading, using, modifying and/or developing or reproducing the
** software by the user in light of its specific status of free software,
** that may mean that it is complicated to manipulate, and that also
** therefore means that it is reserved for developers and experienced
** professionals having in-depth computer knowledge. Users are therefore
** encouraged to load and test the software's suitability as regards
** their requirements in conditions enabling the security of their
** systems and/or data to be ensured and, more generally, to use and
** operate it in the same conditions as regards security.
**
** The fact that you are presently reading this means that you have had
** knowledge of the CeCILL-C license and that you accept its terms.
*/
/************************************************************/
/** **/
/** NAME : graph.h **/
/** **/
/** AUTHOR : Francois PELLEGRINI **/
/** **/
/** FUNCTION : These lines are the data declarations **/
/** for the source graph functions. **/
/** **/
/** DATES : # Version 0.0 : from : 02 dec 1992 **/
/** to 18 may 1993 **/
/** # Version 1.3 : from : 30 apr 1994 **/
/** to 18 may 1994 **/
/** # Version 2.0 : from : 06 jun 1994 **/
/** to 18 aug 1994 **/
/** # Version 3.0 : from : 07 jul 1995 **/
/** to 28 sep 1995 **/
/** # Version 3.1 : from : 28 nov 1995 **/
/** to 28 nov 1995 **/
/** # Version 3.2 : from : 07 sep 1996 **/
/** to 15 sep 1998 **/
/** # Version 3.3 : from : 28 sep 1998 **/
/** to 23 mar 1999 **/
/** # Version 3.4 : from : 20 mar 2000 **/
/** to 20 mar 2000 **/
/** # Version 4.0 : from : 24 nov 2001 **/
/** to 03 mar 2006 **/
/** # Version 5.0 : from : 03 mar 2006 **/
/** to 23 jan 2007 **/
/** **/
/************************************************************/
#define GRAPH_H
/*
** The defines.
*/
/*+ Graph option flags. +*/
#define GRAPHNONE 0x0000 /* No options set */
#define GRAPHFREEEDGE 0x0001 /* Free edgetab array */
#define GRAPHFREEVERT 0x0002 /* Free verttab array */
#define GRAPHFREEVNUM 0x0004 /* Free vnumtab array */
#define GRAPHFREEOTHR 0x0008 /* Free all other arrays */
#define GRAPHFREETABS 0x000F /* Free all graph arrays */
#define GRAPHVERTGROUP 0x0010 /* All vertex arrays grouped */
#define GRAPHEDGEGROUP 0x0020 /* All edge arrays grouped */
#define GRAPHBITSUSED 0x003F /* Significant bits for plain graph routines */
#define GRAPHBITSNOTUSED 0x0040 /* Value above which bits not used by plain graph routines */
#define GRAPHIONOLOADVERT 1 /* Remove vertex loads on loading */
#define GRAPHIONOLOADEDGE 2 /* Remove edge loads on loading */
/*
** The type and structure definitions.
*/
#ifndef GNUMMAX /* If dgraph.h not included */
typedef INT Gnum; /* Vertex and edge numbers */
typedef unsigned INT Gunum; /* Unsigned type of same width */
#define GNUMMAX (INT_MAX) /* Maximum signed Gnum value */
#endif /* GNUMMAX */
/*+ The vertex part type, in compressed form. +*/
typedef byte GraphPart;
/*+ The vertex list structure. Since a vertex list
always refers to a given graph, vertex indices
contained in the vertex list array are based with
respect to the base value of the associated graph.
However, the array itself is not based. +*/
typedef struct VertList_ {
Gnum vnumnbr; /*+ Number of vertices in list +*/
Gnum * restrict vnumtab; /*+ Pointer to vertex array +*/
} VertList;
/*+ The graph flag type. +*/
typedef int GraphFlag; /*+ Graph property flags +*/
/*+ The graph structure. +*/
typedef struct Graph_ {
GraphFlag flagval; /*+ Graph properties +*/
Gnum baseval; /*+ Base index for edge/vertex arrays +*/
Gnum vertnbr; /*+ Nmber of vertices in graph +*/
Gnum vertnnd; /*+ Number of vertices in graph, plus baseval +*/
Gnum * restrict verttax; /*+ Vertex array [based] +*/
Gnum * restrict vendtax; /*+ End vertex array [based] +*/
Gnum * restrict velotax; /*+ Vertex load array (if present) +*/
Gnum velosum; /*+ Overall graph vertex load +*/
Gnum * restrict vnumtax; /*+ Vertex number in ancestor graph +*/
Gnum * restrict vlbltax; /*+ Vertex label (from file) +*/
Gnum edgenbr; /*+ Number of edges (arcs) in graph +*/
Gnum * restrict edgetax; /*+ Edge array [based] +*/
Gnum * restrict edlotax; /*+ Edge load array (if present) +*/
Gnum edlosum; /*+ Sum of edge (in fact arc) loads +*/
Gnum degrmax; /*+ Maximum degree +*/
#ifdef SCOTCH_PTSCOTCH
MPI_Comm proccomm; /*+ Communicator used for parallel algorithm +*/
int procglbnbr; /*+ Number of processes in communictor +*/
int proclocnum; /*+ Rank of process in current communicator +*/
#endif /* SCOTCH_PTSCOTCH */
} Graph;
/*
** The function prototypes.
*/
#ifndef GRAPH
#define static
#endif
int listInit (VertList *);
void listExit (VertList *);
int listAlloc (VertList *, Gnum);
int listFree (VertList *);
int listLoad (VertList *, FILE *);
int listSave (VertList *, FILE *);
void listSort (VertList *);
int listCopy (VertList *, VertList *);
int graphInit (Graph * const);
void graphExit (Graph * const);
void graphFree (Graph * const);
int graphLoad (Graph * const, FILE * const, const Gnum, const GraphFlag);
int graphLoad2 (const Gnum, const Gnum, const Gnum * const, const Gnum * const, Gnum * restrict const, const Gnum, const Gnum * const);
int graphSave (const Graph * const, FILE * const);
Gnum graphBase (Graph * const, const Gnum);
int graphInduceList (const Graph * const, const VertList * const, Graph * const);
int graphInducePart (const Graph * const, const GraphPart *, const Gnum, const GraphPart, Graph * const);
int graphCheck (const Graph *);
#ifdef GEOM_H
int graphGeomLoadChac (Graph * restrict const, Geom * restrict const, FILE * const, FILE * const, const char * const);
int graphGeomSaveChac (const Graph * restrict const, const Geom * restrict const, FILE * const, FILE * const, const char * const);
int graphGeomLoadHabo (Graph * restrict const, Geom * restrict const, FILE * const, FILE * const, const char * const);
int graphGeomLoadScot (Graph * restrict const, Geom * restrict const, FILE * const, FILE * const, const char * const);
int graphGeomSaveScot (const Graph * restrict const, const Geom * restrict const, FILE * const, FILE * const, const char * const);
#endif /* GEOM_H */
#undef static
|
