Skip to content
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.

Sign up for GitHub

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

Jump to bottom

[Port] Why G.weights is the transpose of adjacency_matrix(G) #11

Closed
gdalle opened this issue Nov 11, 2021 · 1 comment
Closed

[Port] Why G.weights is the transpose of adjacency_matrix(G) #11

gdalle opened this issue Nov 11, 2021 · 1 comment
Labels
question Further information is requested

Comments

@gdalle
Copy link
Member

gdalle commented Nov 11, 2021

See sbromberger/SimpleWeightedGraphs.jl#65
@gdalle gdalle added the question Further information is requested label Nov 11, 2021
@gdalle gdalle changed the title [Port] Why G.weights is the transpose of adjacent_matrix(G) [Port] Why G.weights is the transpose of adjacency_matrix(G) Nov 11, 2021
@hdavid16 hdavid16 mentioned this issue May 18, 2022
Closed
@gdalle
Copy link
Member Author

gdalle commented Apr 6, 2023

The reason this issue was still open in the original repo is because many algorithms used g.weights instead of weights(g), which would be the more julian way. This has been fixed by #14

@gdalle gdalle closed this as completed Apr 6, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
question Further information is requested
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@gdalle