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.
Le dimanche 8 mars 2020 20:07:01 UTC+1, Suraj Modi a écrit : > > 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. > -- You received this message because you are subscribed to the Google Groups "sage-gsoc" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-gsoc/eab8431a-cfca-434d-ab12-61a61df81972%40googlegroups.com.
