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 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 1994-11-02 21:21:27 PST Newsgroups: comp.lang.ada Path: bga.com!news.sprintlink.net!news.indirect.com!wisniews From: wisniews@indirect.com (Joe Wisniewski) Subject: Re: need program Message-ID: Sender: usenet@indirect.com (System Operator) Organization: Internet Direct, indirect.com Date: Thu, 3 Nov 1994 05:21:27 GMT References: <399751$kuo@hubcap.clemson.edu> X-Newsreader: TIN [version 1.2 PL2] Date: 1994-11-03T05:21:27+00:00 List-Id: Micah Jon Pering (mpering@earth.cs.clemson.edu) wrote: : 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 hi m the route. : mpering@cs.clemson.edu Hmmmmm? Getting to be end of the semester. Too many football games instead of time in the computer lab? Certainly you wouldn't be asking for someone reading this group to take away your pleasure of figuring this out for yourself? ;--0) Seriously, are you asking for tips on recursion in Ada? If so, we can help you there. If the former ...... Good luck. BTW. You need to put hard carriage returns in your messages. Joe Wisniewski : -- : Taipan of Clemson