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/2adaeedc-2337-4772-bc3f-d3828b5e0485n%40googlegroups.com.
