GSOC 13 - Graph Algorithms for Cassovary

[Pankaj Bhambhani]

Hi,

I am Pankaj Bhambhani, a final year B.Tech. student from DA-IICT,
India. I have been involved with KDE for the past 2 summers, doing
Season of KDE (SOK) with them in 2011 and Google Summer of Code with
them in 2012. I worked on Choqok, a microblogging client during this
time. I integrated features of Facebook in the software. My project
can be found here https://github.com/pankajb64/choqok-facebook

I am interested in doing GSOC this year with Cassovary. I have played
around with Cassovary for some time and plan to implement simple graph
algorithms like Graph Coloring (Vertex and Edge), Chromatic Number,
Shortest Path Algorithm and Minimum Spanning Tree Algorithms for
Cassovary.

I am not sure what to write as implementation details. It would be
great If I could get more information about the requirements and
approach.

Regards,
Pankaj Bhambhani.

[Pankaj Gupta]

Hi,

Adding simple graph algorithms to Cassovary would be great, and would be a very nice way to get started and warmed up with the existing project, though the GSOC project itself is about graph compression.

> --
> You received this message because you are subscribed to the Google Groups "Cassovary" group.
> To unsubscribe from this group and stop receiving emails from it, send an email to twitter-cassov...@googlegroups.com.
> For more options, visit https://groups.google.com/groups/opt_out.
>
>

[Pankaj Bhambhani]

So that means adding these graph algorithms isn't a Good GSOC project in itself ?

I actually added a proposal for the same.

If u wish I can withdraw the proposal

[Pankaj Gupta]

yeah, we are not really interested in all the textbook algorithms....

Pankaj