| 1 |
(* Copyright (C) 2005-2025 Free Software Foundation, Inc. *) |
| 2 |
(* This file is part of GNU Modula-2. |
| 3 |
|
| 4 |
GNU Modula-2 is free software; you can redistribute it and/or modify it under |
| 5 |
the terms of the GNU General Public License as published by the Free |
| 6 |
Software Foundation; either version 3, or (at your option) any later |
| 7 |
version. |
| 8 |
|
| 9 |
GNU Modula-2 is distributed in the hope that it will be useful, but WITHOUT ANY |
| 10 |
WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| 11 |
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| 12 |
for more details. |
| 13 |
|
| 14 |
You should have received a copy of the GNU General Public License along |
| 15 |
with gm2; see the file COPYING. If not, write to the Free Software |
| 16 |
Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *) |
| 17 |
DEFINITION MODULE Find ; |
| 18 |
|
| 19 |
(* |
| 20 |
Title : WriteMap |
| 21 |
Author : Gaius Mulley |
| 22 |
Date : Sat Dec 7 16:04:47 gmt 1991 |
| 23 |
LastEdit : Sat Dec 7 16:04:47 gmt 1991 |
| 24 |
System : LOGITECH MODULA-2/86 |
| 25 |
Description: Works out an optimum route from a start position |
| 26 |
to a finish position. |
| 27 |
*) |
| 28 |
|
| 29 |
EXPORT QUALIFIED FindOptimumRoute ; |
| 30 |
|
| 31 |
|
| 32 |
(* |
| 33 |
FindOptimumRoute - finds the optimum route between two points, |
| 34 |
x1, y1, x2, y2. The directions are returned |
| 35 |
in a string, Commands. A boolean is returned |
| 36 |
if any commands were entered. |
| 37 |
*) |
| 38 |
|
| 39 |
PROCEDURE FindOptimumRoute (x1, y1, x2, y2: INTEGER; |
| 40 |
VAR Commands: ARRAY OF CHAR) : BOOLEAN ; |
| 41 |
|
| 42 |
(* |
| 43 |
IsOptimumRoutePossible - returns true if we can use the optimum |
| 44 |
route procedure to work out how to get |
| 45 |
to position, x2, y2 from x1, y1. |
| 46 |
*) |
| 47 |
|
| 48 |
PROCEDURE IsOptimumRoutePossible (x1, y1, x2, y2: INTEGER) : BOOLEAN ; |
| 49 |
|
| 50 |
|
| 51 |
END Find. |