-
-
Notifications
You must be signed in to change notification settings - Fork 481
New issue
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
random_spanning_tree ignores weights #30566
Comments
comment:1
I don't have a development environment on my computer at the moment, but the difference should be in the following line: new_s = neighbours[randint(0, len(neighbours) - 1)] Instead, |
Author: David Coudert |
Commit: |
comment:3
With this branch, the walk considers the weights. New commits:
|
comment:4
Moving to 9.4, as 9.3 has been released. |
comment:5
Setting a new milestone for this ticket based on a cursory review. |
comment:7
Clean the use of weights as part of #13112 |
comment:8
ca me parait bien. Peut-etre ajouter un doctest que le resultat est bien un arbre lorsqu'on utilise les poids ? |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:10
Tu as raison. |
Reviewer: Frédéric Chapoton |
comment:11
ok, positif |
Changed branch from public/graphs/30566_random_spanning_tree to |
!Aldous/Broder on a weighted graph should perform a random walk on that graph which considers the weights, and this is not the case at the moment.
Options:
Component: graph theory
Keywords: random_spanning_tree, aldous/broder, weighted_graphs
Author: David Coudert
Branch/Commit:
16816c8
Reviewer: Frédéric Chapoton
Issue created by migration from https://trac.sagemath.org/ticket/30566
The text was updated successfully, but these errors were encountered: