Introduction to community

[Naman Jain]

Hey everyone! I am Naman Jain, currently pursuing Computer science and Social sciences at IIIT-Delhi. I am an experienced programmer in various languages(C, C++, Python, Java). I am interested to work on “Diameter, radius, eccentricities and distances” project this summer. I have done various courses like data structures, analysis and design of algorithms, linear algebra etc. which might be helpful in contributing to this project. I am appreciably interested in graph theory and ready to put up a lot of efforts in this field. I look positively to contribute to this organisation and be a part of GSOC 2020 SageMath team.

Regards

[David Coudert]

Thank you for your interest in this project.

Before applying for GSoC with Sagemath, you should start getting familiar with Sagemath (how to play with graphs, do basic algorithms, etc.) and with the developer guide http://doc.sagemath.org/html/en/developer/index.html (what’s the programing standard, how to use git, 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/

Reading the papers related to the project is also important.

Sincerely,

David Coudert.

[Suraj Modi]

Hello everyone,

I am Suraj Kumar Modi a 3rd-year undergrad student at NIT Durgapur, currently pursuing computer science and engineering. I am an aspirant of GSOC 2020. I have developed an interest in the project idea "Diameter, radius, eccentricities, and distances" and has also installed sage on the local machine and also created my git trac account. I have been looking through the repository and am facing problems while searching for location of the implementation of algorithms such as 'Dijkstra_Boost','Floyd-Warshall-Cython','Johnson_Boost' etc as a newcomer.

If someone could guide me through the problem and show me the proper way to present the problem to the community that would be awesome. 

[Suraj Modi]

Hello everyone,

I am Suraj Kumar Modi an undergrad student at NIT Durgapur, I am currently in my third year pursuing computer science and engineering I am also an aspirant for GSOC 2020. I have developed an interest in sagemath on the project idea "Diameter, radius, eccentricities, and distances ". I have already installed sage in my local machine and also set up a git trac account. I have been looking through the repository and have been facing some of the problems like the locating the implementations of algorithms like 'Floyd-Warshall-Cython','Johnson_Boost','Dijkstra_Boost','NetworkX' etc as a newcomer. If someone could guide me through and show me the proper process to present such doubts to the community, that would be awesome.

[David Coudert]

A first step of the project is to draw a map of the location of the algorithms. Some of them are in `generic_graph.py`, `distances_all_pairs.pyx`  and in the backends (base/...).

The location corresponds usually to the use of a particular data structure. Indeed, we can use specific implementations  when the graph is unweighted / weighted, directed or not, dense or sparse, etc.

[Samuel Lelièvre]

Sun 2020-03-08 19:07:01 UTC, Suraj Modi:

>

> I have been looking through the repository and have been facing

> problems locating the implementations of algorithms like

> 'Floyd-Warshall-Cython', 'Johnson_Boost', 'Dijkstra_Boost',

> 'NetworkX', etc.

Here are two ways to figure out what files things live in.

1.

Open a terminal, change to the Sage root repository, and use

`git grep`. This searches in all files under version control.

For instance (the initial dollar sign represents the shell prompt,

so copy the rest of the commands without the prompt).

    $ cd `sage -c "print(SAGE_ROOT)"`

    $ pwd

    $ git grep "Johnson_Boost" src

2.

Or if you already started Sage, you can use `search_src`

(which runs the command above for you from inside Sage):

     sage: search_src("Johnson_Boost")