The DSM class should beneficiates from other methods related to adjacency matrices. See the wikipedia pages to list some functions that could be of interest, then implement them. We could have functions to change/sort the order of the elements, and also transitive closure function.
Boost priority
Boost priority in our backlog through Polar.sh. Higher pledge, higher priority.
Minimum pledge by user/organization is $5, minimum amount for boost is $30.
The DSM class should beneficiates from other methods related to adjacency matrices. See the wikipedia pages to list some functions that could be of interest, then implement them. We could have functions to change/sort the order of the elements, and also transitive closure function.
Boost priority