diff options
| author | Jarrod Millman <jarrod.millman@gmail.com> | 2020-11-12 09:32:30 -0800 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2020-11-12 09:32:30 -0800 |
| commit | fc458e1d40149c08c2a00beaad94cd49c9f0260d (patch) | |
| tree | b062ecedc5d952cb4c5a99fe6b4b99023c62794f /examples | |
| parent | 7694a7281e37e49d6f84c8bb28dd0a85351dde3e (diff) | |
| download | networkx-fc458e1d40149c08c2a00beaad94cd49c9f0260d.tar.gz | |
Sphinx33 (#4342)
* Update sphinx
* Cleanup sphinx warnings
Diffstat (limited to 'examples')
| -rw-r--r-- | examples/algorithms/plot_dedensification.py | 4 | ||||
| -rw-r--r-- | examples/drawing/plot_degree.py | 6 |
2 files changed, 5 insertions, 5 deletions
diff --git a/examples/algorithms/plot_dedensification.py b/examples/algorithms/plot_dedensification.py index 97aa04a0..309e3527 100644 --- a/examples/algorithms/plot_dedensification.py +++ b/examples/algorithms/plot_dedensification.py @@ -1,7 +1,7 @@ """ -============= +=============== Dedensification -============= +=============== Examples of dedensification of a graph. Dedensification retains the structural pattern of the original graph and will only add compressor nodes when doing so diff --git a/examples/drawing/plot_degree.py b/examples/drawing/plot_degree.py index 7670927f..6fc5994b 100644 --- a/examples/drawing/plot_degree.py +++ b/examples/drawing/plot_degree.py @@ -9,9 +9,9 @@ nodes with two common techniques: a *degree-rank plot* and a In this example, a random Graph is generated with 100 nodes. The degree of each node is determined, and a figure is generated showing three things: - 1. The subgraph of connected components - 2. The degree-rank plot for the Graph, and - 3. The degree histogram +1. The subgraph of connected components +2. The degree-rank plot for the Graph, and +3. The degree histogram """ import networkx as nx import numpy as np |