1
/* Copyright 2004,2007,2008 ENSEIRB, INRIA & CNRS
1
/* Copyright 2004,2007,2008,2010 ENSEIRB, INRIA & CNRS
3
3
** This file is part of the Scotch software package for static mapping,
4
4
** graph partitioning and sparse matrix ordering.
131
133
usagePrint (stdout, C_usageList);
134
fprintf (stderr, "gmk_hy, version %s - F. Pellegrini\n", SCOTCH_VERSION);
135
fprintf (stderr, "Copyright 2004,2007,2008 ENSEIRB, INRIA & CNRS, France\n");
136
fprintf (stderr, "gmk_hy, version " SCOTCH_VERSION_STRING "\n");
137
fprintf (stderr, "Copyright 2004,2007,2008,2010 ENSEIRB, INRIA & CNRS, France\n");
136
138
fprintf (stderr, "This software is libre/free software under CeCILL-C -- see the user's manual for more information\n");
147
149
hnbr = 1 << hdim; /* Compute number of vertices */
148
150
hbit = 1 << (hdim - 1); /* Compute highest bit value */
150
fprintf (C_filepntrsrcout, "0\n%ld\t%ld\n0\t000\n",
151
(long) hnbr, /* Print number of vertices */
152
(long) (hdim * hnbr)); /* Print number of edges (arcs) */
152
fprintf (C_filepntrsrcout, "0\n" SCOTCH_NUMSTRING "\t" SCOTCH_NUMSTRING "\n0\t000\n",
153
(SCOTCH_Num) hnbr, /* Print number of vertices */
154
(SCOTCH_Num) (hdim * hnbr)); /* Print number of edges (arcs) */
154
156
for (hvrt = 0; hvrt < hnbr; hvrt ++) { /* For all vertices */
155
fprintf (C_filepntrsrcout, "%ld",
156
(long) hdim); /* Output number of neighbors */
157
for (hngb = hbit; hngb > 0; hngb >>= 1) /* For all vertex bits */
158
fprintf (C_filepntrsrcout, "\t%ld", /* Write corresponding neighbor */
159
(long) (hvrt ^ hngb));
157
fprintf (C_filepntrsrcout, "" SCOTCH_NUMSTRING "",
158
(SCOTCH_Num) hdim); /* Output number of neighbors */
159
for (hngb = hbit; hngb > 0; hngb >>= 1) /* For all vertex bits */
160
fprintf (C_filepntrsrcout, "\t" SCOTCH_NUMSTRING, /* Write corresponding neighbor */
161
(SCOTCH_Num) (hvrt ^ hngb));
160
162
fprintf (C_filepntrsrcout, "\n");