We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
As reported in [1], the following code produces an exception :
sage: B = {0:{1:2,2:5,3:4},1:{2:2,4:7},2:{3:1,4:4,5:3},3:{5:4},4:{5:1,6:5},5:{6:7}} sage: grafo3 = Graph(B,weighted=True) sage: matad = grafo3.weighted_adjacency_matrix() sage: grafo4 = Graph(matad,format = "adjacency_matrix", weighted=True) sage: grafo4.shortest_path(0,6,by_weight=True)
This, because Sage has some problems understanding that the graph is not a multigraph...
[1] https://groups.google.com/forum/?fromgroups=#!topic/sage-support/rIpMl1u7VXE
CC: @fchapoton
Component: graph theory
Author: Nathann Cohen
Reviewer: Frédéric Chapoton
Merged: sage-5.7.beta1
Issue created by migration from https://trac.sagemath.org/ticket/13919
The text was updated successfully, but these errors were encountered:
Please correct the failing doctest, otherwise it's ok
Sorry, something went wrong.
Attachment: trac_13919.patch.gz
Updated !
Nathann
ok, let it go. Positive review !
jasongrout
rlmill
nathanncohen
No branches or pull requests
As reported in [1], the following code produces an exception :
This, because Sage has some problems understanding that the graph is not a multigraph...
[1] https://groups.google.com/forum/?fromgroups=#!topic/sage-support/rIpMl1u7VXE
CC: @fchapoton
Component: graph theory
Author: Nathann Cohen
Reviewer: Frédéric Chapoton
Merged: sage-5.7.beta1
Issue created by migration from https://trac.sagemath.org/ticket/13919
The text was updated successfully, but these errors were encountered: