Graph algorithms
Project description
scikit-network
Simple and efficient tools for the analysis of large graphs
Free software: BSD license
Documentation: https://scikit-network.readthedocs.io.
Quickstart
Install scikit-network:
$ pip install scikit-network
To use scikit-network in a project:
import sknetwork as skn
History
0.6.1 (2019-06-19)
Minor bug
0.6.0 (2019-06-19)
Largest connected component
Simplex projection
Sparse Low Rank Decomposition
Numba support for Paris
Various fixes and updates
0.5.0 (2019-04-18)
Unified Louvain.
0.4.0 (2019-04-03)
Added Louvain for directed graphs and ComboLouvain for bipartite graphs.
0.3.0 (2019-03-29)
Updated clustering module and documentation.
0.2.0 (2019-03-21)
First real release on PyPI.
0.1.1 (2018-05-29)
First release on PyPI.
Project details
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
scikit-network-0.6.1.tar.gz
(41.6 kB
view hashes)
Built Distribution
Close
Hashes for scikit_network-0.6.1-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 374942028825781ace1f21ad968d4c878e6ba99bc44decccd33a3e71cc460217 |
|
MD5 | bf6f83dc3622a7f1b2791adf58a0f7b4 |
|
BLAKE2b-256 | 1bdd43a35a0dec7f8ecc561f238f54e65ec7c1e0741cdf9a4dbda87ca7937b26 |