Thank you for your interest in this project. Recall that the short description gives ideas for the project and you, the potential contributor, are expected to turn the ideas into a full proposal.
It is strongly suggested to start reading the developper guide of Sagemath, and the application guide https://wiki.sagemath.org/GSoC/Contributors For algorithms, you can read for instance recent papers on the k shortest simple paths like - https://dl.acm.org/doi/pdf/10.1145/3626567 and references there in - https://link.springer.com/article/10.1007/s12532-025-00276-0 Sincerely, David. On Monday, March 17, 2025 at 5:09:27 PM UTC+1 Pradyumna Prahas wrote: > Dear David, > > Thank you for your response and the suggested resources. I have looked > into the SageMath graph module and reviewed the relevant code. I am also > familiar with graph algorithms like Dijkstra’s and Yen’s, which are used in > the k-shortest paths problem as discussed in the referenced papers. > > I wanted to ask for your insights on what additional contributions could > be valuable beyond what is currently implemented in SageMath. Are there any > specific improvements or extensions you would recommend for this project? > > Additionally, I noticed that the SageMath GSoC website has been down for a > while. Is there an alternative way to access project details or past > proposals? > > Looking forward to your guidance. > > Best regards, > Pradyumna Prahas > -- 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 sage-gsoc+unsubscr...@googlegroups.com. To view this discussion visit https://groups.google.com/d/msgid/sage-gsoc/5c31f6d4-1659-4419-96bc-44aae2d3adafn%40googlegroups.com.
