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=unavailable autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: Simple Components (Generic_Directed_Graph) Date: Mon, 30 Oct 2017 21:29:26 +0100 Organization: Aioe.org NNTP Server Message-ID: References: NNTP-Posting-Host: MajGvm9MbNtGBKE7r8NgYA.user.gioia.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 7bit X-Complaints-To: abuse@aioe.org User-Agent: Mozilla/5.0 (Windows NT 10.0; WOW64; rv:52.0) Gecko/20100101 Thunderbird/52.4.0 X-Notice: Filtered by postfilter v. 0.8.2 Content-Language: en-US Xref: news.eternal-september.org comp.lang.ada:48674 Date: 2017-10-30T21:29:26+01:00 List-Id: On 2017-10-30 18:46, Dennis Lee Bieber wrote: > Presuming bidirectionality is required, I'd probably end up with a > structure where each node has a linked list of "IN" references, and a > linked list of "OUT" references. Right. The structure is allocated in the pool for each node. The package has the parameters for the sizes of the IN and OUT neighbor sets. > Granted, of one's requirements provide a limit to the number of IN > and OUT links, one might be able to use a fixed array of references > for each. IN and OUT sets are enlarged to n*Increment/100, where n is the current set size. Increment is the package parameter too. In most cases graph connectivity and topology allows reasonable guessing the IN and OUT sizes. P.S. Surely there is no optimal graph implementation for all cases. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de