Hello ! (it seems like is_connected should really only be used for undirected > graphs). >
It is useful from time to time in digraphs too. Sometimes you cannot split a DiGraph problem into one sub-problem for each strongly connected component, yet it is possible if you consider independently the 'connected components of the underlying graph'. This being said, if you think that it could confuse other persons you could add some [note/longer explanation] in the documentation of GenericGraph.is_connected. This could clearly be made clearer, with a pointer toward `is_strongly_connected` for instance. Nathann -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
