Enter the query into the form above. You can look for specific version of a package by using @ symbol like this: gcc@10.
API method:
GET /api/packages?search=hello&page=1&limit=20
where search is your query, page is a page number and limit is a number of items on a single page. Pagination information (such as a number of pages and etc) is returned
in response headers.
If you'd like to join our channel search send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
Leiden is a general algorithm for methods of community detection in large networks and is an extension of the Louvain algorithm. This packages provides a Python wrapper to the C++ implementation.
The PyGSP is a Python package to ease signal processing on graphs.
Mscgen is a small program that parses Message Sequence Chart descriptions and produces PNG, SVG, EPS or server side image maps (ismaps) as the output. Message Sequence Charts (MSCs) are a way of representing entities and interactions over some time period and are often used in combination with SDL. MSCs are popular in Telecoms to specify how protocols operate although MSCs need not be complicated to create or use. Mscgen aims to provide a simple text language that is clear to create, edit and understand, which can also be transformed into common image formats for display or printing.
Faiss is a library for efficient similarity search and clustering of dense vectors. It contains algorithms that search in sets of vectors of any size, up to ones that possibly do not fit in RAM. It also contains supporting code for evaluation and parameter tuning.
This package provides tools for building and manipulating graphs in Python.
LEMON is a C++ template library providing efficient implementations of common data structures and algorithms with focus on combinatorial optimization tasks connected mainly with graphs and networks. This is the OpenROAD Project's fork with C++20 compatibility fixes.
plantri and fullgen (contained in the same package) are programs for the generation of certain types of planar graphs. Graphs are generated in such a way that exactly one member of each isomorphism class is output without the need for storing them.
rw computes rank-width and rank-decompositions of graphs.
Leiden is a general algorithm for methods of community detection in large networks and is an extension of the Louvain algorithm. This package implements the Leiden algorithm in C++ and can be run on graphs of millions of nodes (as long as they can fit in memory).
QVGE is a multiplatform graph editor written in C++/Qt. Its main goal is to make possible visually edit two-dimensional graphs in a simple and intuitive way.
Graph-tool is an efficient Python module for manipulation and statistical analysis of graphs (a.k.a. networks). Contrary to most other Python modules with similar functionality, the core data structures and algorithms are implemented in C++, making extensive use of template metaprogramming, based heavily on the Boost Graph Library. This confers it a level of performance that is comparable (both in memory usage and computation time) to that of a pure C/C++ library.
This package provides an implementation of the function bioFabric for creating scalable network digrams where nodes are represented by horizontal lines, and edges are represented by vertical lines.
The package provides a reference implementation of the linear time edge addition algorithm for embedding planar graphs and isolating planarity obstructions.
This package provides a library for the analysis of networks and graphs. It can handle large graphs very well and provides functions for generating random and regular graphs, graph visualization, centrality methods and much more.
PyUNLocBoX uses proximal splitting methods to solve non-differentiable convex optimization problems.
Faiss is a library for efficient similarity search and clustering of dense vectors. This package provides Python bindings to the Faiss library.
Basis Universal is an LDR/HDR GPU compressed texture interchange system supporting transcoding to a large number of GPU texture formats.
CGAL provides easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics and motion planning, mesh generation, numerical methods, etc. It provides data structures and algorithms such as triangulations, Voronoi diagrams, polygons, polyhedra, mesh generation, and many more.
AutoTrace is a utility for converting bitmap into vector graphics. It can trace outlines and midlines, effect color reduction or despeckling and has support for many input and output formats. It can be used with the autotrace utility or as a C library, libautotrace.
FGallery is a static, JavaScript photo gallery generator with minimalist look. The result can be uploaded on any web server without additional requirements.
OpenEXR provides the specification and reference implementation of the EXR file format. The purpose of EXR format is to accurately and efficiently represent high-dynamic-range scene-linear image data and associated metadata, with strong support for multi-part, multi-channel use cases.
MiniFB (Mini FrameBuffer) is a small, cross-platform library that makes it easy to render (32-bit) pixels in a window.
2geom is a C++ library of mathematics for paths, curves, and other geometric calculations. Designed for vector graphics, it tackles Bézier curves, conic sections, paths, intersections, transformations, and basic geometries.
When a GPU renders triangle meshes, various stages of the GPU pipeline have to process vertex and index data. The efficiency of these stages depends on the data you feed them; this library provides algorithms to help optimize meshes for these stages, as well as algorithms to reduce the mesh complexity and storage overhead.