/* -*-c-*-
*
- * $Id: graph.c,v 1.2 2003/03/08 00:40:32 mdw Exp $
+ * $Id: graph.c,v 1.3 2003/03/10 23:37:21 mdw Exp $
*
* Graph theory stuff
*
/*----- Revision history --------------------------------------------------*
*
* $Log: graph.c,v $
+ * Revision 1.3 2003/03/10 23:37:21 mdw
+ * Fix single point TSP.
+ *
* Revision 1.2 2003/03/08 00:40:32 mdw
* Fix unsigned crapness in travelling-salesman solver.
*
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]];