GPXSee is a Qt-based GPS log file viewer and analyzer that supports all common GPS log file formats. It can display multiple tracks on various on- and off-line maps. You can easily add more maps and graph other captured data such as elevation, speed, heart rate, power, temperature, and gear shifts.

GPS Correlate is a program to match a recorded GPS track with the EXIF tags in digital camera photos, and update the EXIF tags with the location that the photo was taken. It does this by using the timestamp in the photo and finding a data point in the GPS track that matches, or interpolating a point between two other data points.

GPSBabel converts waypoints, tracks, and routes between hundreds of popular GPS receivers and mapping programs. It contains extensive data manipulation abilities making it a convenient for server-side processing or as the back-end for other tools. It does not convert, transfer, send, or manipulate maps.

GNU Gama is a program for the adjustment of geodetic networks. It is useful in measurements where Global Positioning System (GPS) is not available, such as underground. It features the ability to adjust in local Cartesian coordinates as well as partial support for adjustments in global coordinate systems.

Faiss is a library for efficient similarity search and clustering of dense vectors. This package provides Python bindings to the Faiss library.

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 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.

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.

This package provides a pure Python implementation of the Louvain algorithm for community detection in large networks.

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.

This package provides tools for building and manipulating graphs in Python.

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.

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.

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.

The PyGSP is a Python package to ease signal processing on graphs.

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.

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.

The package provides a reference implementation of the linear time edge addition algorithm for embedding planar graphs and isolating planarity obstructions.

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 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)).

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.

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.