Boost logo

Boost :

From: aalness_at_[hidden]
Date: 2001-06-21 15:10:23

Couldn't you keep an external property map containing your own edge
identity information and just make new edges actually connecting the
vertices but in the property map u know that the new edges u create are
actually one edge? Like an associative map mapping from actual edges to
hyperedge identities. And if you wanted to use some sort of shortest path
or whatever algorithm you would have a visitor which would know how to
interprete this external property map? I hope that made sense to you.

-Andy Alness

On Thu, 21 Jun 2001, Ruth Brown wrote:

> Looking for ideas on how to represent a hypergraph (more than 2
> vertices per edge) using BGL (and/or other graph template libraries).
> Has anyone done this?
> Thanks,
> Ruth
> ----------------------------------------
> Ruth Brown
> rbrown_at_[hidden]
> 336-584-3878
> Info: Unsubscribe: <mailto:boost-unsubscribe_at_[hidden]>
> Your use of Yahoo! Groups is subject to

Boost list run by bdawes at, gregod at, cpdaniel at, john at