#14056: Distance matrix
--------------------------------+-------------------------------------------
Reporter: azi | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: trivial | Milestone: sage-5.7
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
--------------------------------+-------------------------------------------
Comment (by ncohen):
Hello !
Well, I think that it is a matrix only if all vertices are numbered from 0
to n-1, which is not the case in Sage. The reason why distance_all_pairs
returns a dict of dict is precisely because vertices are not necessarily
integers.
If you prefer to have a matrix instead, and because I am always scared of
the number of functions we have in graph, I would prefer (whatever you
want the future name to be.. By the way distance_matrix is nice indeed)
that distance_all_pairs disappear, and become an optional result of
distance_matrix.
Like `distance_matrix(as_dictionary = True)` ? What do you think of it ?
The point is that `distance_all_pairs` really is `distance_matrix`.
Vertices just aren't integers.
I had a lot of whine, and a lot of good duck, and a lot of good cheese. I
may make more sense tomorrow. Anyway, have fun ! `:-)`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14056#comment:4>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
