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.
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.
This package implements the Louvain algorithm for community detection in C++ and exposes it to Python. 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 function is find_partition which finds the optimal partition using the louvain algorithm for a number of different methods.
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.
The package provides a reference implementation of the linear time edge addition algorithm for embedding planar graphs and isolating planarity obstructions.
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.
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).
The plfit command fits power-law distributions to empirical (discrete or continuous) data, according to the method of Clauset, Shalizi and Newman (Clauset A, Shalizi CR and Newman MEJ: Power-law distributions in empirical data. SIAM Review 51, 661-703 (2009)).
rw computes rank-width and rank-decompositions of 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.
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 a pure Python implementation of the Louvain algorithm for community detection in large networks.
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.
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.
This package provides tools for building and manipulating graphs in Python.
The PyGSP is a Python package to ease signal processing on graphs.
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.
This package implements the Louvain algorithm for community detection in C++ and exposes it to Python. 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 function is find_partition which finds the optimal partition using the louvain algorithm for a number of different methods.
Faiss is a library for efficient similarity search and clustering of dense vectors. This package provides Python bindings to the Faiss library.
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.
Drawpile is a drawing program that allows share the canvas with other users in real time.
Some feature highlights:
Shared canvas using the built-in server or a dedicated server
Record, play back and export drawing sessions
Simple animation support
Layers and blending modes
Text layers
Supports pressure sensitive Wacom tablets
Built-in chat
Supports OpenRaster file format
Encrypted connections using SSL
Automatic port forwarding with UPnP
facedetect is a face detector for batch processing. It answers the question: "Is there a face in this image?" and gives back either an exit code or the coordinates of each detect face in the standard output. facedetect is used in software such as fgallery to improve the thumbnail cutting region, so that faces are always centered.
ASLI (A Simple Lattice Infiller) is a command-line tool that allows users to fill any 3D geometry with a functionally graded lattice. The lattice infill is constructed out of unit cells, described by implicit functions, whose type, size and feature can be varied locally to obtain the desired local properties.
This package provides a header only C++11 glTF (GL Transmission Format) 2.0 library.
GL Transmission Format (glTF) is a royalty-free specification for the efficient transmission and loading of 3D scenes and models by applications. glTF minimizes both the size of 3D assets, and the runtime processing needed to unpack and use those assets. glTF defines an extensible, common publishing format for 3D content tools and services that streamlines authoring workflows and enables interoperable use of content across the industry.