Project Homepage
|
Source Code
2.5
Install
Tutorial
Gallery
Reference
Introduction
Graph types
Algorithms
Functions
Graph generators
Atlas
Classic
Expanders
Lattice
Small
Random Graphs
Duplication Divergence
Degree Sequence
Random Clustered
Directed
Geometric
Line Graph
Ego Graph
Stochastic
AS graph
Intersection
Social Networks
Community
Spectral
Trees
Non Isomorphic Trees
Triads
Joint Degree Sequence
Mycielski
Harary Graph
Cographs
Interval Graph
Sudoku
Linear algebra
Converting to and from other data formats
Relabeling nodes
Reading and writing graphs
Drawing
Randomness
Exceptions
Utilities
Glossary
Developer Guide
Release Log
License
About Us
Citing
Bibliography
NetworkX
»
Reference
»
Graph generators
»
networkx.generators.small.heawood_graph
networkx.generators.small.heawood_graph
¶
heawood_graph
(
create_using
=
None
)
[source]
¶
Return the Heawood graph, a (3,6) cage.