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.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: 103376,bc4137777a63bff
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news3.google.com!news.glorb.com!border1.nntp.dca.giganews.com!nntp.giganews.com!local01.nntp.dca.giganews.com!nntp.comcast.com!news.comcast.com.POSTED!not-for-mail
NNTP-Posting-Date: Wed, 27 Jul 2005 20:53:19 -0500
From: tmoran@acm.org
Newsgroups: comp.lang.ada
Subject: Re: Help needed for ada package
References: <%4WFe.9489$dU3.2220@newsread2.news.pas.earthlink.net>
X-Newsreader: Tom's custom newsreader
Message-ID: <WvGdnae9gc0Sp3XfRVn-og@comcast.com>
Date: Wed, 27 Jul 2005 20:53:19 -0500
NNTP-Posting-Host: 24.6.143.98
X-Trace: 
 sv3-2dNDBBX1H/IaQcJacf9PftG6ei8e/2x+fAvC2YSZmqxV5a7KgVILvNKHZmbUgYyXdkNwuQCRz7rKVE2!bCkr8ZzhRbTm+NdsG5DFgDPzH1gsYmJVhPxu9b53WfqLbXbbJEjer87qCc8cbCgptN6gvGQQr0w=
X-Complaints-To: abuse@comcast.net
X-DMCA-Complaints-To: dmca@comcast.net
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint
 properly
X-Postfilter: 1.3.32
Xref: g2news1.google.com comp.lang.ada:3812
Date: 2005-07-27T20:53:19-05:00
List-Id: <comp.lang.ada>

> visiting each of her associates would be approx O(log N).
  And visiting all the associates of each of those ...
IIRC Warshall's algorithm for transitive closure is O(n**3).
Is there a faster way?