From: Victor Porton <porton@narod.ru>
Subject: Standard Set types don't support a feature
Date: Sun, 29 Oct 2017 18:15:32 +0200
Date: 2017-10-29T18:15:32+02:00 [thread overview]
Message-ID: <ot4ur3$oa4$1@gioia.aioe.org> (raw)
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
next reply other threads:[~2017-10-29 16:15 UTC|newest]
Thread overview: 8+ messages / expand[flat|nested] mbox.gz Atom feed top
2017-10-29 16:15 Victor Porton [this message]
2017-10-29 17:10 ` Standard Set types don't support a feature Dmitry A. Kazakov
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