Boost logo

Boost :

Subject: Re: [boost] GSOC 2010 - BGL Graph Connectives.
From: Andrew Sutton (andrew.n.sutton_at_[hidden])
Date: 2010-03-25 13:25:23

> My first question is: How big is the graph? Or students will try to do as
> big as possible.
> My second question is: What type of data-structures (matrix or list) will
> be used?
> I attached my ideas in the PDF file below. Please have a look.
> I appreciate all responses,

 Hi Tri,

The BGL is generic so the expectation is that the algorithms should also be
generic and made efficient for either adjacency matrices or adjacency lists.
The size of the graphs is variable.

Good proposals will demonstrate that you understand the design organization
of the BGL as much as the theoretical background required for the project.

Andrew Sutton

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