scikit-network 0.2.0

Graph algorithms

scikit-network

Graph algorithms

• Free software: BSD license

• Documentation: https://scikit-network.readthedocs.io.

How to use scikit-network?

Graphs have a unified format, namely scipy.sparse.csr_matrix.

About the documentation

We use the following notations in the documentation:

• \(A\) denotes the adjacency matrix for undirected and directed graphs.

• \(B\) denotes the biadjacency matrix for bipartite graphs (possibly non-square).

• \(d = A1\) or \(B1\) is the out-degree vector and \(D = \text{diag}(d)\) the associated diagonal matrix.

• \(f = A^T1\) or \(B^T1\) is the in-degree vector and \(F = \text{diag}(f)\) the associated diagonal matrix.

• \(w = 1^TA1\) or \(1 ^TB1\) is the total weight of the graph.

History

0.2.0 (2019-03-21)

• First real release on PyPI.

0.1.1 (2018-06-01)

• First release on PyPI.