/* -*-c-*-
*
- * $Id: graph.c,v 1.2 2003/03/08 00:40:32 mdw Exp $
+ * $Id$
*
* Graph theory stuff
*
* Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
-/*----- Revision history --------------------------------------------------*
- *
- * $Log: graph.c,v $
- * Revision 1.2 2003/03/08 00:40:32 mdw
- * Fix unsigned crapness in travelling-salesman solver.
- *
- * Revision 1.1 2003/03/07 00:45:13 mdw
- * Graph theory functions.
- *
- */
-
/*----- Header files ------------------------------------------------------*/
#include <assert.h>
if (nn <= 2) {
memcpy(r_best, r, nn * sizeof(*r));
- if (n == 1)
+ if (nn == 1)
c_best = a[r[0] * n + r[0]];
else
c_best = a[r[0] * n + r[1]];