#14056: Distance matrix
--------------------------------+-------------------------------------------
Reporter: azi | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_info
Priority: trivial | Milestone: sage-5.10
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
--------------------------------+-------------------------------------------
Comment (by azi):
Replying to [comment:21 ncohen]:
>
> > What I meant was that If we choose to put this thing under
distance_all_pairs and add an argument returning the distance matrix, then
I would still like to have a method called distance_matrix() that would
call distance_all_pairs asking for the distance matrix.
>
> Whaaaattttttt ??`O_o`
>
> "call distance_all_pairs asking for the distance matrix" ? What does
that mean ?
>
> What I described above was a function names "distance_matrix" which
returns the distance matrix when no optional flags are given, and which
returns the current result of "distance_all_pairs" when an optional flag,
say `labels = True`, is added to it.
>
> And `distance_all_pairs` would be removed from generic_graph.
Oookay now I think I *do* understand you. Somehow I still like it more the
way it is structured now (an algorithmically inclined guy would look for
the distance_all_pairs method) a math guy for the distance matrix and
since we already have the distance_all_pairs method I don't see any good
reasons for removing it.
That said, why would you like this specific change?
>
> What about this ?
>
> > And I would want to have that since I would like to have a method
called distance_matrix() as we do for the other mentioned matrices!
>
> Is that still contradicting what I said above ? I don't understand it
either.
>
> > That being said I am now starting to doubt it is a good idea to mix
this distance matrix with the shortest path algorithm.
>
> Why would we mix "distance matrix" with a shortest path algorithm ? The
`distance_all_pairs` method is written in Cython and actually creates a C
array filled with the content of the distance matrix.
>
> > Especially if we don't have the indexed matrix thing and since
(apperently) infinity is not digested by matrices.
> >
> > What do you think
>
> Let's make our previous messages clear for a start `:-P`
>
> Sorry, I have been exchanging a couple of angry messages this morning so
I am probably a bit unpleasant to deal with this morning `>_<`
Hahaha. No worries, I am also quite tense (GSOC is building unnecessary
pressure :S). I can hardly imagining you writing unpleasant emails btw :-)
>
> Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14056#comment:22>
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.
