/*
* Empire - A multi-player, client/server Internet based war game.
- * Copyright (C) 1986-2006, Dave Pare, Jeff Bailey, Thomas Ruschak,
- * Ken Stevens, Steve McClure
+ * Copyright (C) 1986-2013, Dave Pare, Jeff Bailey, Thomas Ruschak,
+ * Ken Stevens, Steve McClure, Markus Armbruster
*
- * This program is free software; you can redistribute it and/or modify
+ * Empire is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
- * the Free Software Foundation; either version 2 of the License, or
+ * the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* ---
*
* ---
*
* best.c: Show the best path between two sectors
- *
+ *
* Known contributors to this file:
- *
+ * Markus Armbruster, 2011
*/
#include <config.h>
-#include "misc.h"
-#include "player.h"
-#include "sect.h"
-#include "xy.h"
-#include "path.h"
-#include "nsc.h"
-#include "nat.h"
#include "commands.h"
+#include "path.h"
int
best(void)
{
double cost;
- char *path;
struct sctstr s1, s2;
struct nstr_sect nstr, nstr2;
char buf[1024];
+ size_t len;
if (!snxtsct(&nstr, player->argp[1]))
return RET_SYN;
return RET_SYN;
while (!player->aborted && nxtsct(&nstr, &s1)) {
- if (s1.sct_own != player->cnum)
+ if (!player->owner)
continue;
- snxtsct(&nstr2, player->argp[2]);
+ snxtsct_rewind(&nstr2);
while (!player->aborted && nxtsct(&nstr2, &s2)) {
- if (s2.sct_own != player->cnum)
+ if (!player->owner)
continue;
- path = BestLandPath(buf, &s1, &s2, &cost, MOB_ROAD);
- if (path)
- pr("Best path from %s to %s is %s (cost %1.3f)\n",
- xyas(s1.sct_x, s1.sct_y, player->cnum),
- xyas(s2.sct_x, s2.sct_y, player->cnum), path, cost);
- else
+ cost = path_find(s1.sct_x, s1.sct_y, s2.sct_x, s2.sct_y,
+ player->cnum, MOB_MOVE);
+ if (cost < 0)
pr("No owned path from %s to %s exists!\n",
xyas(s1.sct_x, s1.sct_y, player->cnum),
xyas(s2.sct_x, s2.sct_y, player->cnum));
+ else {
+ len = path_find_route(buf, sizeof(buf),
+ s1.sct_x, s1.sct_y,
+ s2.sct_x, s2.sct_y);
+ pr("Best path from %s to %s is %s%s (cost %1.3f)\n",
+ xyas(s1.sct_x, s1.sct_y, player->cnum),
+ xyas(s2.sct_x, s2.sct_y, player->cnum),
+ buf, len < sizeof(buf) ? "h" : "...",
+ cost);
+ }
}
}
return 0;