Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site brl-tgr.ARPA
Path: utzoo!watmath!clyde!bonnie!akgua!whuxlm!harpo!decvax!genrad!panda!talcott!harvard!seismo!brl-tgr!tgr!root%bostonu.csnet@CSNET-RELAY.ARPA
From: root%bostonu.csnet@CSNET-RELAY.ARPA (BostonU SysMgr)
Newsgroups: net.unix-wizards
Subject: Re: inode number -> pathname? (4.2BSD)
Message-ID: <11580@brl-tgr.ARPA>
Date: Mon, 15-Jul-85 12:00:45 EDT
Article-I.D.: brl-tgr.11580
Posted: Mon Jul 15 12:00:45 1985
Date-Received: Wed, 17-Jul-85 21:11:28 EDT
Sender: news@brl-tgr.ARPA
Lines: 27

>>From: larry@MITRE.ARPA
>>Subject: Re: inode number -> pathname? (4.2BSD)
>>
>>write one to some people at DEC. Then I found that PIP command that
>>allowed linking dirs (MCR PIP NEW=OLD/LI ?? trivia quiz.) I got ill
>>and flamed about why they should hire computer scientists at least
>>once in a while to help the VMS developers understand the
>>differences between a tree and a cyclic graph (I still use this as
>>an example when I teach data structures.)
>>
>>I blushed when I found it in UNIX, although I admit the discouragements
>>are much more obvious.
>>
>>	-Barry Shein, Boston University
>
>	Who ever said a directory stucture had to be a "TREE" ??
>
>			-Larry.


You are right, they don't have to be trees. Maybe we should use
some non-deterministic algorithm altogether. Ok, no sarcasm,
but searching trees is a *little* easier than more generalized
graphs...c'mon...yes you can do anything, but it doesn't mean
it's necessary.

	-Barry Shein, Boston University