From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: *
X-Spam-Status: No, score=1.1 required=5.0 tests=BAYES_40,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,3d34fcf076cd32a9,start
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1994-11-02 15:25:21 PST
Path: 
 bga.com!news.sprintlink.net!howland.reston.ans.net!gatech!hubcap.clemson.edu!earth!mpering
From: mpering@earth.cs.clemson.edu (Micah Jon Pering)
Newsgroups: comp.lang.ada
Subject: need program
Date: 2 Nov 1994 23:25:21 GMT
Organization: Clemson University
Distribution: world
Message-ID: <399751$kuo@hubcap.clemson.edu>
NNTP-Posting-Host: earth.cs.clemson.edu
Date: 1994-11-02T23:25:21+00:00
List-Id: <comp.lang.ada>

I need a program that uses recursion.  It is to make a matrix of 15 cities.  The program reads in connecting routes of the fifteen cities and displays the matrix.  Then, if a user says that he wishes to travel from city 4 to city 5, the display shows him the route.

mpering@cs.clemson.edu

-- 
Taipan of Clemson