Hello Everyone. I am Tamandeep, student of Delhi Technological University. I did my homework and went through everything. I have a few questions regarding Edge connectivity and edge disjoint spanning trees in digraphs 1. We can also implement round robin in such a way so that it augments each path upon discovery , but not done in research paper, should I implement that also or stick to implemention given in research paper. 2. As two algorithms given in the research paper apply on both directed and undirected graphs, but the implementation for undirected graphs is already improved in the issue. Shouldn't we use these algorithms for both undirected and directed graph. 3. As cycle scanning is not valid in round robin, but we can generalize cycle, should we do that also because it achieves the same efficiency. 4. Round robin is extended to multigraphs also, but should we focus on simply graphs or we should also do for multigraph also?
-- 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/5e863e9f-02df-45c1-bc52-5696c6893482n%40googlegroups.com.
