On Thu, 6 Sep 2018, John H Palmieri wrote:
Also not ideal, but you could first try u < v, and if that fails, catch the error and use str(u) < str(v).
But we can have Graph({'1': [1]}) and so not total order for str() of vertices.
-- Jori Mäntysalo
On Thu, 6 Sep 2018, John H Palmieri wrote:
Also not ideal, but you could first try u < v, and if that fails, catch the error and use str(u) < str(v).
But we can have Graph({'1': [1]}) and so not total order for str() of vertices.
-- Jori Mäntysalo