Responding to a comment from trac: > One problem IMHO with `c_graph` is that as is (correct me if I'm wrong) > we won't be able to have a fast `in_neighbors`.
This is certainly true, if you're using a SparseGraph to represent a DiGraph. In this case, I think there should actually be two SparseGraphs in the backend, representing arcs and reversed arcs. That way we never need to call in_neighbors, only out_neighbors of the other SparseGraph. This would double the time of many operations, but those operations are much much faster than NetworkX so that might not be so bad. Other suggestions are welcome! -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
