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 |
| Zebra graph | zebra_graph |
| Giraffe graph | giraffe_graph |
| Camel graph | camel_graph |
| (a,b)-leaper graph | leaper_graph |
| Fiveleaper graph | fiveleaper_graph |
| Prism graph | prism_graph |
| Stacked prism graph | stacked_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 |
| Johnson graph | johnson_graph |
| Pell graph | pell_graph |
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.7.tar.gz
(8.2 kB
view hashes)
Built Distribution
Close
Hashes for graph_generators-0.1.7-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 01cdcbd457feac65d2621b85bd16c7e71c0d9fa3b6c95679705bfd312e62ef93 |
|
| MD5 | 51f285a410c2adf02ad40cb57050d9b7 |
|
| BLAKE2b-256 | 97e4ed8ce01837f210e8e608e4ccf9f81ecd12b28952538e85d21d5475752fc9 |
