src/lib/commands/best.c

Go to the documentation of this file.
00001 /*
00002  *  Empire - A multi-player, client/server Internet based war game.
00003  *  Copyright (C) 1986-2007, Dave Pare, Jeff Bailey, Thomas Ruschak,
00004  *                           Ken Stevens, Steve McClure
00005  *
00006  *  This program is free software; you can redistribute it and/or modify
00007  *  it under the terms of the GNU General Public License as published by
00008  *  the Free Software Foundation; either version 2 of the License, or
00009  *  (at your option) any later version.
00010  *
00011  *  This program is distributed in the hope that it will be useful,
00012  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
00013  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
00014  *  GNU General Public License for more details.
00015  *
00016  *  You should have received a copy of the GNU General Public License
00017  *  along with this program; if not, write to the Free Software
00018  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
00019  *
00020  *  ---
00021  *
00022  *  See files README, COPYING and CREDITS in the root of the source
00023  *  tree for related information and legal notices.  It is expected
00024  *  that future projects/authors will amend these files as needed.
00025  *
00026  *  ---
00027  *
00028  *  best.c: Show the best path between two sectors
00029  * 
00030  *  Known contributors to this file:
00031  *     
00032  */
00033 
00034 #include <config.h>
00035 
00036 #include "commands.h"
00037 #include "path.h"
00038 
00039 int
00040 best(void)
00041 {
00042     double cost;
00043     char *path;
00044     struct sctstr s1, s2;
00045     struct nstr_sect nstr, nstr2;
00046     char buf[1024];
00047 
00048     if (!snxtsct(&nstr, player->argp[1]))
00049         return RET_SYN;
00050 
00051     if (!snxtsct(&nstr2, player->argp[2]))
00052         return RET_SYN;
00053 
00054     while (!player->aborted && nxtsct(&nstr, &s1)) {
00055         if (s1.sct_own != player->cnum)
00056             continue;
00057         snxtsct(&nstr2, player->argp[2]);
00058         while (!player->aborted && nxtsct(&nstr2, &s2)) {
00059             if (s2.sct_own != player->cnum)
00060                 continue;
00061             path = BestLandPath(buf, &s1, &s2, &cost, MOB_MOVE);
00062             if (path)
00063                 pr("Best path from %s to %s is %s (cost %1.3f)\n",
00064                    xyas(s1.sct_x, s1.sct_y, player->cnum),
00065                    xyas(s2.sct_x, s2.sct_y, player->cnum), path, cost);
00066             else
00067                 pr("No owned path from %s to %s exists!\n",
00068                    xyas(s1.sct_x, s1.sct_y, player->cnum),
00069                    xyas(s2.sct_x, s2.sct_y, player->cnum));
00070         }
00071     }
00072     return 0;
00073 }

Generated on Fri Mar 28 11:01:11 2008 for empserver by  doxygen 1.5.2