There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

This package currently provides a placeholder for a multi-threaded topological radix sort algorithm. It serves as a foundation for developing and comparing high-performance sorting routines in Julia.

Pull requests help you collaborate on code with other people. As pull requests are created, they’ll appear here in a searchable and filterable list. To get started, you should create a pull request.