Thank you for your interest in this project. > 1)The above algorithm only works well for directed sparse graphs which > *aren't* strongly connected, >
Why isn't it working for strongly connected graphs ? > Is it fine to modify important and central functions like > *simple_BFS()* > just to accomodate the needs of this new algorithm? > it depends on the modification as this method is also used elsewhere in the graph module. The modification should not affect the behavior. > In my implementation I have implemented all the BFS's as a part of the > main algorithm function itself ( instead of funtion calls ), is that ok > since it dosen't affect code readability negatively*.* > We added method simple_BFS to avoid code duplication. However, it is perfectly acceptable to implement your own BFS if simple_BFS is not appropriate (missing instructions, etc.). Sincerely, David. -- 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/ea1fcad1-d0cd-45de-a556-2fe3e6176903%40googlegroups.com.
