[Lemon-user] hyperarcs, hyperedges

[Balazs Dezso]

Hi,

the hypergraphs are not implemented yet. This time, the std::set<Node> is the 
best solution to store hyperedges (for example a vector of sets), and 
std::pair<std::set<Node>, std::set<Node> > to store hyperarcs. But there are 
not implemented hypergraph algorithms in LEMON yet.

Best regards, Balazs

On Tuesday 06 April 2010 09:26:47 Csaba Nemes wrote:
> Hi,
> 
> Is it possible to define hyperarcs with lemon?
> 
> I started a project with lemon::ListDigraph  but it has turned out
> that "we will have hyperarcs as well".
> I am looking for something like this:
> http://lemon.cs.elte.hu/egres/open/Directed_hypergraphs
> 
> If it is not possible, please suggest workaround.
> 
> Thanks!
>