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.7.0 (2019-06-24)
Updated PageRank
Added tests for Numba versioning
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.7.0.tar.gz
(42.5 kB
view hashes)
Built Distribution
Close
Hashes for scikit_network-0.7.0-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | e3e68bebcc6b6f3043509d878578d030895d1a0374ee4dfcf48c936018f103ae |
|
MD5 | 9ead43cfa29698c34e64151e558d8cf1 |
|
BLAKE2b-256 | ec5358c16f9594a4cd98cd61c7c1e4e81bfdee053b9880801dff593c0887eb43 |