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=-0.8 required=5.0 tests=BAYES_00,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 18:00:01 PST Path: bga.com!news.sprintlink.net!howland.reston.ans.net!gatech!swrinde!news.uh.edu!uuneo.neosoft.com!Starbase.NeoSoft.COM!not-for-mail From: dweller@Starbase.NeoSoft.COM (David Weller) Newsgroups: comp.lang.ada Subject: Re: need program Date: 2 Nov 1994 20:00:01 -0600 Organization: NeoSoft Internet Services +1 713 684 5969 Message-ID: <399g71$b72@Starbase.NeoSoft.COM> References: <399751$kuo@hubcap.clemson.edu> NNTP-Posting-Host: starbase.neosoft.com Date: 1994-11-02T20:00:01-06:00 List-Id: In article <399751$kuo@hubcap.clemson.edu>, Micah Jon Pering 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 him the route. > Running behind on your homework assignment? :-) -- Proud (and vocal) member of Team Ada! (and Team OS/2) ||This is not your Ada -- Very Cool. Doesn't Suck. || father's Ada For all sorts of interesting Ada tidbits, run the command: ||________________ "finger dweller@starbase.neosoft.com | more" (or e-mail with "finger" as subj.) ObNitPick: Spelling Ada as ADA is like spelling C++ as CPLUSPLUS. :-)