You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Oct 8, 2021. It is now read-only.
Given the new Adjoint functionality in 1.0, it's probably time to rethink how we backstore the data in SimpleWeightedGraphs. This will likely mean a substantial overhaul.
What was actually the reason for transposing the adjacency matrix?
Because SparseMatrixCSC is column-major, and adjacency matrices are typically row-major. Since most of the traversal operations focus on outgoing edges, it is important that the outneighbors are close together (adjacent) in memory.
And is there a reason why this package works with a sparse adjacency matrix and not with a adjacency list like SimpleGraph?
Yes. This has better cache performance for very large graphs.
Given the new
Adjoint
functionality in 1.0, it's probably time to rethink how we backstore the data in SimpleWeightedGraphs. This will likely mean a substantial overhaul.cc @simonschoelly
The text was updated successfully, but these errors were encountered: