Adaptive overlapping community discovery algorithm package in python.
Project description
shuffle_graph
Adaptive overlapping community discovery algorithm package in python.
Welcome to complete the documentation.
Installation
Installation can be done through pip. You must have python version >= 3.6.
pip install shuffle-graph
Usage
The statement to import the package:
from shuffle_graph_package import *
Example:
>>> calculate_number_of_shuffles_required_under_default_random_function(10000)
6
>>> G = Graph({0: {1: {}}, 1: {0: {}, 2: {}}, 2: {1: {}, 3: {}}, 3: {2: {}, 4: {}}, 4: {3: {}}})
>>> shuffle_graph(G, 1, 65535).adj #Set seed to make the results repeatable.
AdjacencyView({3: {2: {}, 4: {}}, 4: {3: {}}, 1: {0: {}, 2: {}}, 2: {3: {}, 1: {}}, 0: {1: {}}})
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
shuffle_graph-1.0.1.tar.gz
(3.3 kB
view hashes)
Built Distribution
Close
Hashes for shuffle_graph-1.0.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | a0d58739e210ed23cd7b5def42eac40fa7e94d2f77d5197d6ce38be7a434bc6c |
|
MD5 | 1f47003e510f06d62e29f14eb3bff9c5 |
|
BLAKE2b-256 | 501e32191477af6dbc64a252541ea2e906484bf5fa8acf73608a97c1cefac215 |