Efficient approximate k-nearest neighbors graph construction and search in Julia
MIT License
Visualize the dependency graph of a Julia package
Clique recycling non-Gaussian (multi-modal) factor graph solver; also see Caesar.jl.
Julia implementation of (resource) Constrained Shortest Path algorithms
Polyhedral Computation Interface
A library for graph analysis written Julia.
Proximal algorithms for nonsmooth optimization in Julia
Julia's CUTEst Interface
Koç University deep learning framework.
Error propagation calculator and library for physical measurements. It supports real and complex...
Package for local graph clustering
PointNeighbors.jl: Neighborhood search with fixed search radius in Julia
Implementation of a Partial Least Squares Regressor
A Julia package for data clustering
Graph Neural Networks in Julia
Parallel & lightning fast implementation of available classic and contemporary variants of the KM...