Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!lsuc!ncrcan!brian
From: brian@ncrcan.Toronto.NCR.COM (Brian Onn)
Newsgroups: comp.mail.uucp
Subject: Re: maps and cost
Message-ID: <334@ncrcan.Toronto.NCR.COM>
Date: Fri, 16-Oct-87 12:39:59 EDT
Article-I.D.: ncrcan.334
Posted: Fri Oct 16 12:39:59 1987
Date-Received: Sat, 17-Oct-87 20:07:21 EDT
References: <771@cblpf.ATT.COM>
Reply-To: brian@ncrcan.UUCP (Brian Onn)
Organization: NCR Canada Ltd., Mississauga, Ontario
Lines: 21

In article <771@cblpf.ATT.COM> gws2@cblpf.ATT.COM (x5965) writes:
>Here is one for all you uucp/uucp map guru's..
> [nice picture deleted]
>Pathalias says that the shortest path from A to D is A!B!C!D
>Why? Dosent pathalias take into effect that D talks to A???
>Does pathalias take only into account info from the "FROM" site??

Pathalias does realize that A talks to D.  It gets this information from
the entry for site D, since that says D talks to A. However, since it is
not listed in A's entry that A talks to D, pathalias assumes that the
connection cost from A to D is arbitrarily high, I think around 30000 or so.

Thus the cheapest path according to the given information is A!B!C!D.


-- 

 +-------------------+--------------------------------------------------------+
 | Brian Onn         | UUCP:..!{uunet!mnetor, watmath!utai}!lsuc!ncrcan!brian |
 | NCR Canada Ltd.   | INTERNET: brian@ncrcan.Toronto.NCR.COM                 |
 +-------------------+--------------------------------------------------------+