#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 azi):
Hello!
Nathann I don't think its polite to mention your dinner without offering
it to us as well!!! At least for the cheese :)))
As for the comments!
The distance matrix is an algebraic object and is not "affected" by the
ordering of the vertices. In the same manner as the adjacency_matrix does
not return a vertex -> int map.
If you still think it makes to return a map then we could add (analogously
to the automorphism_group function) an option "translation=True" in order
to return such a map as well. We'd need to add this to the
adjacency_matrix() as well for the sake of consistency.
As for the pair at distances k. The adjacency matrix of a graph is defined
as the (0,1) matrix such that an entry (i,j) has a 1 if and only if the
vertices v_i,v_j are at distance 1. Hence to me it makes pretty much sense
to add an option here to generalize this to the case when v_i,v_j are at
distance k.
Why don't you agree dcoudert?
Thanks for the comments and have a nice day!
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14056#comment:6>
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.
