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.5 required=5.0 tests=BAYES_05,FREEMAIL_FROM,
	MAILING_LIST_MULTI autolearn=unavailable autolearn_force=no
	version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,ecfc0548c2df0d76
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2003-11-12 03:31:30 PST
Path: 
 archiver1.google.com!news2.google.com!news.maxwell.syr.edu!newsfeed.stueberl.de!proxad.net!freenix!enst.fr!melchior!cuivre.fr.eu.org!melchior.frmug.org!not-for-mail
From: "amado.alves" <amado.alves@netcabo.pt>
Newsgroups: comp.lang.ada
Subject: RE: MI ammunition : linked lists
Date: Wed, 12 Nov 2003 11:29:33 -0000
Organization: Cuivre, Argent, Or
Message-ID: <mailman.329.1068636640.25614.comp.lang.ada@ada-france.org>
NNTP-Posting-Host: lovelace.ada-france.org
Mime-Version: 1.0
Content-Type: text/plain;
	charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
X-Trace: melchior.cuivre.fr.eu.org 1068636641 86759 80.67.180.195 (12 Nov 2003
 11:30:41 GMT)
X-Complaints-To: usenet@melchior.cuivre.fr.eu.org
NNTP-Posting-Date: Wed, 12 Nov 2003 11:30:41 +0000 (UTC)
To: <comp.lang.ada@ada-france.org>
Return-Path: <amado.alves@netcabo.pt>
X-MimeOLE: Produced By Microsoft Exchange V6.0.6470.0
Content-Class: urn:content-classes:message
X-MS-Has-Attach: 
X-MS-TNEF-Correlator: 
Thread-Topic: MI ammunition : linked lists
thread-index: AcOotN5ku9nOaqPfSoebIZ1NCw7QOAAWpjDK
X-OriginalArrivalTime: 12 Nov 2003 11:29:54.0307 (UTC)
	FILETIME=[4B387D30:01C3A910]
X-Virus-Scanned: by amavisd-new-20030616-p5 (Debian) at ada-france.org
X-BeenThere: comp.lang.ada@ada-france.org
X-Mailman-Version: 2.1.2
Precedence: list
List-Id: Gateway to the comp.lang.ada Usenet newsgroup
	<comp.lang.ada.ada-france.org>
List-Unsubscribe: <http://www.ada-france.org/mailman/listinfo/comp.lang.ada>,
	<mailto:comp.lang.ada-request@ada-france.org?subject=unsubscribe>
List-Post: <mailto:comp.lang.ada@ada-france.org>
List-Help: <mailto:comp.lang.ada-request@ada-france.org?subject=help>
List-Subscribe: <http://www.ada-france.org/mailman/listinfo/comp.lang.ada>,
	<mailto:comp.lang.ada-request@ada-france.org?subject=subscribe>
Xref: archiver1.google.com comp.lang.ada:2404
Date: 2003-11-12T11:29:33+00:00

"...so the structural relation between nodes in a graph is
provided by an iterator pointing to 0 or more of the neigbours in some
order. That could be applied to lists as well... "

Exactly. Actually I'm entertaining the idea of a list being a particular =
case of tree namely of a tree with a fixed or bounded fanout (outdegree) =
of 1.