NetworkX
2.3
Install
Tutorial
Reference
Introduction
Graph types
Algorithms
Functions
Graph generators
Atlas
Classic
networkx.generators.classic.balanced_tree
networkx.generators.classic.barbell_graph
networkx.generators.classic.complete_graph
networkx.generators.classic.complete_multipartite_graph
networkx.generators.classic.circular_ladder_graph
networkx.generators.classic.circulant_graph
networkx.generators.classic.cycle_graph
networkx.generators.classic.dorogovtsev_goltsev_mendes_graph
networkx.generators.classic.empty_graph
networkx.generators.classic.full_rary_tree
networkx.generators.classic.ladder_graph
networkx.generators.classic.lollipop_graph
networkx.generators.classic.null_graph
networkx.generators.classic.path_graph
networkx.generators.classic.star_graph
networkx.generators.classic.trivial_graph
networkx.generators.classic.turan_graph
networkx.generators.classic.wheel_graph
Expanders
Lattice
Small
Random Graphs
Duplication Divergence
Degree Sequence
Random Clustered
Directed
Geometric
Line Graph
Ego Graph
Stochastic
Intersection
Social Networks
Community
Spectral
Trees
Non Isomorphic Trees
Triads
Joint Degree Sequence
Mycielski
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
Credits
Citing
Bibliography
Examples
NetworkX
Docs
»
Reference
»
Graph generators
»
networkx.generators.classic.trivial_graph
networkx.generators.classic.trivial_graph
¶
trivial_graph
(
create_using=None
)
[source]
¶
Return the Trivial graph with one node (with label 0) and no edges.