Skip to content

Commit

Permalink
Remove .. plot:: directive
Browse files Browse the repository at this point in the history
  • Loading branch information
bichengying committed May 10, 2020
1 parent 0345c93 commit 4710f69
Show file tree
Hide file tree
Showing 2 changed files with 6 additions and 19 deletions.
24 changes: 6 additions & 18 deletions bluefog/common/topology_util.py
Original file line number Diff line number Diff line change
Expand Up @@ -53,10 +53,7 @@ def PowerTwoRingGraph(size: int) -> nx.DiGraph:
"""Generate graph topology such that each points only
connected to a point such that the index difference is power of 2.
Example: A PowerTwoRingGraph with 12 nodes:
.. plot::
:context: close-figs
Example: Plot a PowerTwoRingGraph with 12 nodes:
>>> import networkx as nx
>>> from bluefog.common import topology_util
Expand Down Expand Up @@ -84,10 +81,7 @@ def MeshGrid2DGraph(size: int, shape: Tuple[int, int] = None) -> nx.DiGraph:
If size is a prime number, nrow will be 1, and ncol will be size, which degrades the topology
into a linear one.
Example: A MeshGrid2DGraph with 16 nodes:
.. plot::
:context: close-figs
Example: Plot a MeshGrid2DGraph with 16 nodes:
>>> import networkx as nx
>>> from bluefog.common import topology_util
Expand Down Expand Up @@ -134,9 +128,7 @@ def StarGraph(size: int, center_rank: int = 0) -> nx.DiGraph:
bidirection, i.e. if the weight from node i to node j is non-zero, so
is the weight from node j to node i.
Example: A StarGraph with 16 nodes:
.. plot::
Example: Plot a StarGraph with 16 nodes:
>>> import networkx as nx
>>> from bluefog.common import topology_util
Expand All @@ -159,9 +151,7 @@ def RingGraph(size: int, connect_style: int = 0) -> nx.DiGraph:
0 represents the bi-connection, 1 represents the left-connection,
and 2 represents the right-connection.
Example: A RingGraph with 16 nodes:
.. plot::
Example: Plot a RingGraph with 16 nodes:
>>> import networkx as nx
>>> from bluefog.common import topology_util
Expand Down Expand Up @@ -201,10 +191,8 @@ def FullyConnectedGraph(size: int) -> nx.DiGraph:
"""Generate fully connected structure of graph.
For example, a FullyConnectedGraph with 16 nodes:
Example: A FullyConnectedGraph 16 nodes:
.. plot::
Example: Plot a FullyConnectedGraph 16 nodes
>>> import networkx as nx
>>> from bluefog.common import topology_util
>>> G = topology_util.FullyConnectedGraph(16)
Expand Down
1 change: 0 additions & 1 deletion docs/conf.py
Original file line number Diff line number Diff line change
Expand Up @@ -80,7 +80,6 @@
'logo_only': False,
'display_version': True,
'prev_next_buttons_location': 'bottom',
'github_url': 'https://github.com/Bluefog-Lib/bluefog',
}

# Add any paths that contain custom static files (such as style sheets) here,
Expand Down

0 comments on commit 4710f69

Please sign in to comment.