Subject: Re: [boost] [gsoc] Boost graph library - Hypergraphs
From: Thorsten Ottosen (thorsten.ottosen_at_[hidden])
Date: 2009-03-26 17:57:18
Om Prasad Patri skrev:
> I'm a Computer Science undergrad from India applying for GSoC 2009.
> This mail is regarding the hypergraph project for the BGL on the ideas list.
> I have taken courses in graph theory and algorithms and have the C++
> background required. I have gone through the idea and done a little
> 'research' on the topic. I have also read the boost graph library
> documentation and found the concept to be quite interesting and somewhat
> tough to implement. I have certain ideas and doubts on the hypergraph
> project which I would like to discuss with a mentor.
> First of all, what about the assumptions. Can we assume the hypergraph to be
> directed ro undirected or do we have to try to find a generic solution for
IIRC, hypergraphs are only "undirected". An edge is represented as a set
of vertices, that is, as an element of the powerset of vertices.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk