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!.POSTED!not-for-mail
From: Simon Wright <simon@pushface.org>
Newsgroups: comp.lang.ada
Subject: Re: Standard Set types don't support a feature
Date: Sun, 29 Oct 2017 17:35:45 +0000
Organization: A noiseless patient Spider
Message-ID: <ly60axg8lq.fsf@pushface.org>
References: <ot4ur3$oa4$1@gioia.aioe.org>
Mime-Version: 1.0
Content-Type: text/plain
Injection-Info: reader02.eternal-september.org;
 posting-host="3a6427004cf7abfa3cecb0883f8c3afc";
	logging-data="31068"; mail-complaints-to="abuse@eternal-september.org";
	posting-account="U2FsdGVkX1/ZryvGiJvgfQuBuTZ+G/lqnTMju/LrTgQ="
User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/25.3 (darwin)
Cancel-Lock: sha1:o2X9m1C8aVnSeZEf4Vl4g6X7lnM=
	sha1:Waa8Nm3ihjip8LxcCjYxDaXBw5s=
Xref: news.eternal-september.org comp.lang.ada:48632
Date: 2017-10-29T17:35:45+00:00
List-Id: <comp.lang.ada>

Victor Porton <porton@narod.ru> writes:

> I want to represent a directed graph as a set of pairs (a,b) where a
> and b are vertices.
>
> To efficiently find a transitive closure, I want to search for the
> first element (a,x) of the graph with a given starting vertex a.
>
> It seems that standard containers do not support it (except of silly
> broken use of keys).
>
> What would you suggest? Maybe should I use Bochs?

If you mean the Booch Components[1], please be aware that they aren't
under active development.

[1] https://sourceforge.net/projects/booch95/