git.pond.sub.org Git - empserver/blob - src/lib/commands/best.c

   1 /*
   2  *  Empire - A multi-player, client/server Internet based war game.
   3  *  Copyright (C) 1986-2000, Dave Pare, Jeff Bailey, Thomas Ruschak,
   4  *                           Ken Stevens, Steve McClure
   5  *
   6  *  This program is free software; you can redistribute it and/or modify
   7  *  it under the terms of the GNU General Public License as published by
   8  *  the Free Software Foundation; either version 2 of the License, or
   9  *  (at your option) any later version.
  10  *
  11  *  This program is distributed in the hope that it will be useful,
  12  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  13  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14  *  GNU General Public License for more details.
  15  *
  16  *  You should have received a copy of the GNU General Public License
  17  *  along with this program; if not, write to the Free Software
  18  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  19  *
  20  *  ---
  21  *
  22  *  See the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
  23  *  related information and legal notices. It is expected that any future
  24  *  projects/authors will amend these files as needed.
  25  *
  26  *  ---
  27  *
  28  *  best.c: Show the best path between two sectors
  29  *
  30  *  Known contributors to this file:
  31  *
  32  */
  33
  34 #include "misc.h"
  35 #include "player.h"
  36 #include "var.h"
  37 #include "sect.h"
  38 #include "item.h"
  39 #include "xy.h"
  40 #include "path.h"
  41 #include "nsc.h"
  42 #include "deity.h"
  43 #include "file.h"
  44 #include "nat.h"
  45 #include "commands.h"
  46
  47 int
  48 best(void)
  49 {
  50         double  cost;
  51         s_char  *BestDistPath(), *BestLandPath(), *s;
  52         struct  sctstr s1, s2;
  53         struct  nstr_sect nstr, nstr2;
  54         int     dist=0;
  55         s_char  buf[1024];
  56
  57         dist = player->argp[0][4] == 'd';
  58
  59         if (!snxtsct(&nstr, player->argp[1]))
  60                 return RET_SYN;
  61
  62         if (!snxtsct(&nstr2, player->argp[2]))
  63                 return RET_SYN;
  64
  65         while (!player->aborted && nxtsct(&nstr, &s1)){
  66                 if (s1.sct_own != player->cnum)
  67                         continue;
  68                 snxtsct(&nstr2, player->argp[2]);
  69                 while (!player->aborted && nxtsct(&nstr2, &s2)){
  70                         if (s2.sct_own != player->cnum)
  71                                 continue;
  72                         if (dist)
  73                                 s = BestDistPath(buf, &s1,&s2,&cost, MOB_ROAD);
  74                         else
  75                                 s = BestLandPath(buf, &s1,&s2,&cost, MOB_ROAD);
  76                         if (s != (s_char *)0)
  77                                 pr("Best %spath from %s to %s is %s (cost %1.3f)\n",
  78                                         (dist ? "dist" : ""),
  79                                         xyas(s1.sct_x,s1.sct_y,player->cnum),
  80                                         xyas(s2.sct_x,s2.sct_y,player->cnum), s, cost);
  81                         else
  82                                 pr("No owned path from %s to %s exists!\n",
  83                                         xyas(s1.sct_x,s1.sct_y,player->cnum),
  84                                         xyas(s2.sct_x,s2.sct_y,player->cnum));
  85                 }
  86         }
  87         return 0;
  88 }