GSOC 2021 "Graph drawing and plotting"

66 views
Skip to first unread message

Vadim Abzalov

unread,
Mar 30, 2021, 5:10:43 AM3/30/21
to sage-gsoc

Hi there!

My name is Vadim Abzalov and I am 3rd-year student at the faculty of Mathematics and Mechanics at Saint Petersburg State University in Russia. My specialization is "Software engineering".

My Github: https://github.com/vdshk

I'm familiar with Python and graph theory and interested in deepening my understanding of graph algorithms and sharing them with the community.

I have been maintaining the CFPQ_Data and CFPQ_PyAlgo projects in JetBrains Research for a year now. These projects are entirely written in Python and are used to experimentally investigate graph algorithms in the CFPQ area. Also I wrote several algorithms in Python that were included in the paper accepted at EDBT: 24th International Conference on Extending Database Technology.

At the university, I passed the courses of discrete mathematics and graph theory with excellent results. I also took the Graph Theory course at Coursera. At the moment at the university I am studying graph analysis algorithms.

That's why I am extremely interested in work on the project "Graph drawing and plotting".

I would be glad to get a mentor with whom I can start working on this project and write a proposal right now.

david....@gmail.com

unread,
Mar 30, 2021, 5:23:52 AM3/30/21
to sage-gsoc
Thank you for your interest in Sagemath.

Before applying for GSoC with Sagemath, you should start getting familiar with Sagemath (how to install and use it, code some basic algorithms, etc.) and with the developer guide http://doc.sagemath.org/html/en/developer/index.html (what’s the coding standard, how to use git and trac, etc.). Then, you can start contributing Sagemath with smalls patchs (implementation of a new algorithm or improvement of an existing one).
You can see the current activity at https://trac.sagemath.org/

Concerning the project, one objective is to add more options to commands like G.plot() and G.plot(method='js') where G in a Graph or DiGraph. We want for instance to be able to better select the color of vertices and edges, to increase the width of a subset of edges, etc. 
Another direction for the project is to speed up some algorithms used for plotting graphs.
A prospective student should start getting familiar with Sagemath and do multiple tests to better understand the strengths and limitations of the current tools.

Sincerely,
Reply all
Reply to author
Forward
0 new messages