libfplll9

Library for LLL-reduction of Euclidean lattices, runtime

fpLLL is a library for computing reduced (nearly orthogonal) bases for Euclidean lattices using the LLL algorithm.

ngtcp2-client

implementation of QUIC protocol (development)

ngtcp2 project is an effort to implement QUIC protocol which is now being discussed in IETF QUICWG for its standardization.

libappstreamqt5-3

Qt5 library to access AppStream services

AppStream is a metadata specification which permits software components to provide information about themselves to automated systems and end-users before the software is actually installed. This permits informative displays of new applications to users in software centers, as well as allowing a system to make decisions on which new software a user might want to install (e.g. missing firmware or media handlers).

librte-common-sfc-efx25

Data Plane Development Kit (librte-common-sfc-efx runtime library)

DPDK is a set of libraries for fast packet processing. Applications run in user-space and communicate directly with dedicated network interfaces.

liblibleidenalg1

implementation of the Leiden algorithm in C++ - library

This package implements the Leiden algorithm in C++. It relies on igraph for it to function. Besides the relative flexibility of the implementation, it also scales well, and can be run on graphs of millions of nodes (as long as they can fit in memory). The core class is Optimiser which finds the optimal partition using the Leiden algorithm, which is an extension of the Louvain algorithm for a number of different methods. The methods currently implemented are (1) modularity, (2) Reichardt and Bornholdt's model using the configuration null model and the Erdös-Rényi null model, (3) the Constant Potts model (CPM), (4) Significance, and finally (5) Surprise. In addition, it supports multiplex partition optimisation allowing community detection on for example negative links or multiple time slices. There is the possibility of only partially optimising a partition, so that some community assignments remain fixed. It also provides some support for community detection on bipartite graphs.

python3-isosurfaces

Compute isolines/isosurfaces of scalar fields

Construct isolines/isosurfaces of a 2D/3D scalar field defined by a function, i.e. curves over which `f(x,y)=0` or surfaces over which `f(x,y,z)=0`. Most similar libraries use marching squares or similar over a uniform grid, but this uses a quadtree to avoid wasting time sampling many far from the implicit surface.