Re: Adjacency Matrix Library Project for Google Summer of Code

[Juan Pablo Carbajal]

On Mon, Mar 3, 2014 at 12:52 AM, David Spies <address@hidden> wrote:
> Hello,
> My name is David Spies.  I'm a Masters student in CS at the University of
> Alberta.
>
> I just pulled Octave from the mercurial repository and I noticed the message
> about Google Summer of Code.  I'm very interested in participating.
>
> Particularly, I would really like to work on building a library of sparse
> matrix operations tailored towards graph operations on adjacency matrices
> (including directed, undirected, weighted, and unweighted graphs).  I
> imagine the library itself would mostly be written in octave code, but I
> would still frequently need to work in C++ to add or improve support for the
> underlying sparse matrix operations the library would require.
>
> Would this be a suitable project?
>
> Thank you,
> David
>
> PS: I've attached an octave function for finding the set of all maximal
> cliques on an undirected graph as an example of the sort of thing I'm
> thinking of.

Personally I find this very interesting. however I would suggest also
implementing interfaces with BGL (boost, that might be already in the
dependency list) and other excellent C++ graphs libraries.