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.1 (2019-07-04)
Added Algorithm class for nicer repr of some classes
Added Jupyter notebooks as tutorials in the docs
Minor fixes
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
Built Distribution
Hashes for scikit_network-0.7.1-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | d0985a787de764ce6527865b9abeada46f22bd26e8a9b062de9d384d986cfafe |
|
MD5 | 78a97e09c9552b59d1270f83eb04c501 |
|
BLAKE2b-256 | fc931f4979fa51d6db90656e9c348a3babe0d80fdbc4de76d8169c9e02d6f459 |