From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: Standard Set types don't support a feature
Date: Sun, 29 Oct 2017 18:10:01 +0100
Date: 2017-10-29T18:10:01+01:00 [thread overview]
Message-ID: <ot5217$tp9$1@gioia.aioe.org> (raw)
In-Reply-To: ot4ur3$oa4$1@gioia.aioe.org
On 2017-10-29 17:15, Victor Porton wrote:
> I want to represent a directed graph as a set of pairs (a,b) where a and b
> are vertices.
Any directed graph is a set of pairs.
> 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).
Graph is not a container, not in the sense an array or matrix is.
> What would you suggest? Maybe should I use Bochs?
Simple components have an implementation of directed graphs:
http://www.dmitry-kazakov.de/ada/components.htm#directed_graphs
[ Transitive closure requires no evaluation, a node = graph rooted in
this node ]
--
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de
next prev parent reply other threads:[~2017-10-29 17:10 UTC|newest]
Thread overview: 8+ messages / expand[flat|nested] mbox.gz Atom feed top
2017-10-29 16:15 Standard Set types don't support a feature Victor Porton
2017-10-29 17:10 ` Dmitry A. Kazakov [this message]
2017-10-29 17:35 ` Victor Porton
2017-10-29 18:27 ` Dmitry A. Kazakov
2017-11-12 1:50 ` Robert Eachus
2017-11-17 0:28 ` Randy Brukardt
2017-10-29 17:28 ` Victor Porton
2017-10-29 17:35 ` Simon Wright
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox