Python functions to compute various classes of networkx graphs
Project description
graph-generators
Python functions to compute various classes of networkx
graphs
Requirements
Requires python >= 3.5
and networkx
.
Installation
pip install graph-generators
Usage
After installation, run from graph_generators import *
For instance, keller_graph(n)
returns an n-dimensional Keller graph.
List of graphs
Graph name | Function name |
---|---|
Keller graph | keller_graph |
King graph | king_graph |
Knight graph | knight_graph |
Antelope graph | antelope_graph |
Fiveleaper graph | fiveleaper_graph |
Prism graph | prism_graph |
Moebius ladder graph | mobius_ladder_graph |
Book graph | book_graph |
Stacked book graph | stacked_book_graph |
Odd graph | odd_graph |
Fibonacci cube graph | fibonacci_cube_graph |
Lucas cube graph | lucas_cube_graph |
Halved cube graph | halved_cube_graph |
Folded cube graph | folded_cube_graph |
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
graph-generators-0.1.5.tar.gz
(7.5 kB
view hashes)
Built Distribution
Close
Hashes for graph_generators-0.1.5-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | e1f4d3071c785698ac1f47521e165e02e5d6f87fe0ad6d8822fbd5bd9ac777cd |
|
MD5 | 062d799b79dd398639561065ca3d7cf2 |
|
BLAKE2b-256 | 82ad59b5cc1df3079957acc8c179a5ce48771307573d91a7c4c9be33e35679fa |