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,FREEMAIL_FROM
	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: Victor Porton <porton@narod.ru>
Newsgroups: comp.lang.ada
Subject: Standard Set types don't support a feature
Date: Sun, 29 Oct 2017 18:15:32 +0200
Organization: Aioe.org NNTP Server
Message-ID: <ot4ur3$oa4$1@gioia.aioe.org>
NNTP-Posting-Host: p7dn7ovnlfKNrsGJsG/4aA.user.gioia.aioe.org
Mime-Version: 1.0
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 7Bit
X-Complaints-To: abuse@aioe.org
User-Agent: KNode/4.14.10
X-Notice: Filtered by postfilter v. 0.8.2
Xref: news.eternal-september.org comp.lang.ada:48628
Date: 2017-10-29T18:15:32+02:00
List-Id: <comp.lang.ada>

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?

-- 
Victor Porton - http://portonvictor.org