Thanks for your response. I would like to go with recoding the method with documentation.
I have installed OGDF and sage on my system, using OGDF implementation as a reference, I am implementing Find Triconnected Components <http://www.dtic.mil/dtic/tr/fulltext/u2/746856.pdf> in a graph for sage. Code link is given below. I have been working on an implementation of the Triconnected components algorithm in the research paper in python. The algorithm requires a lot of DFS function calls, corresponding to it. I made some design decisions which I needed to get reviewed. 1. I have stored all the arrays in a class (array_info) such that I can access them in any other classes/functions. a. The advantage of this approach is that there is no need to send all the parameters(arrays) to the functions again and again. b. The demerit is that if a function needs only a few lists from array_info, all the lists in the array_info will be initialized. 2. For DFS to avoid passing graph at each function call, I stored the graph in a parameter of a class (search). I am currently implementing the remaining code required for finding triconnected components. I needed some review of these design decisions and suggestions if any changes I needed to make for better performance. Code: link <https://github.com/SaiHarsh/Triconnected-Component> Thanks, Harsh On Tuesday, February 20, 2018 at 9:43:15 PM UTC+5:30, david....@gmail.com wrote: > > Dear Sai Harsh, > > thank you for your interest in this project. > Yes, the second paper fix several issues of the first paper. Authors of > the second paper have implemented the algorithm in C++ in OGDF ( > http://www.ogdf.net/). > There are two options for this project: 1) create an interface with OGDF > and use it, or 2) recode the method with sufficient documentation. > > The first step is to get familiar with Sagemath, its graph module, and of > course git. > > Best, > David. > > > Le samedi 17 février 2018 09:16:43 UTC+1, Sai Harsh Tondomker a écrit : >> >> Hi, >> I am Sai Harsh, an MS by Research student at IIIT-Hyderabad and my >> research domain is Graph metrics algorithms, currently doing a research >> internship at University of Valencia, Spain. I read the project proposal >> and also went through the referred papers. I understand that the second >> paper aims at correcting the faults in paper one algorithm. I found the >> project interesting and would like to make it my GSOC project. Should I >> start coding the algorithm( finding tri-connected components) for >> demonstration? >> >> I'd be glad to hear from you if there is anything more/else I can do at >> this point in time. >> >> Thank you, >> Sai Harsh >> > -- 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 post to this group, send email to sage-gsoc@googlegroups.com. Visit this group at https://groups.google.com/group/sage-gsoc. For more options, visit https://groups.google.com/d/optout.
