Graph algorithms in Python.
Project description
Edsger
Graph algorithms in Cython
Welcome to our Python library for fast path algorithms on graphs, built with the power of Cython. So far, the library only includes Dijkstra's algorithm but we should add a range of common path algorithms soon. It is also open-source and easy to integrate with other Python libraries.
To get started, simply install the library using pip, and import it into your Python project. Then, you can start using the library to perform efficient path computations on your graphs.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
edsger-0.0.12.tar.gz
(665.7 kB
view hashes)
Built Distribution
Close
Hashes for edsger-0.0.12-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 43c4626aba1b800702a24257b36406c8ab4b009d3157e073956494f155c9c9c7 |
|
| MD5 | 2119677967fd5fa71d966761f2879129 |
|
| BLAKE2b-256 | 7e8eaeda785e5e25278e13d698b411d0cba077f0a0dd66550c4a057b9756be07 |
