On 07/06/2012 08:20 PM, Jeroen Demeyer wrote:
On 2012-07-06 14:10, Nathann Cohen wrote:
Then, of course, we would have to change the is_isomorphic function (it
does not take the bipartition into account).
Indeed, if I create a BipartiteGraph object I would expect the
is_isomorphic() function to check for isomorphism *as bipartite graphs*.
(luckily, for connected graphs, the notions are the same)
Same here. On BipartiteGraph objects I would expect actually *every
algorithm* to make use of the additional data, that is the bipartition,
in case that improves the run time...
--
--
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
