diff --git a/doc/examples/plot_rag.py b/doc/examples/plot_rag.py
index f46d86af..9dd3ca76 100644
--- a/doc/examples/plot_rag.py
+++ b/doc/examples/plot_rag.py
@@ -5,7 +5,7 @@ Region Adjacency Graphs
 
 This example demonstrates the use of the `merge_nodes` function of a Region
 Adjacency Graph (RAG).The `RAG` class represents a undirected weighted graph
-which inherits from `networx.graph` class. When a new node is formed by merging
+which inherits from `networkx.graph` class. When a new node is formed by merging
 two nodes, the edge weight of all the edges incident on the resulting node can
 be updated by a user defined function `weight_func`.
 
diff --git a/skimage/graph/rag.py b/skimage/graph/rag.py
index e20f7c5a..7aa65261 100644
--- a/skimage/graph/rag.py
+++ b/skimage/graph/rag.py
@@ -22,7 +22,7 @@ def min_weight(graph, src, dst, n):
     Returns
     -------
     weight : float
-        The weight between (`src`, `n`) or (`dst`, `n`) in `g` or the
+        The weight between (`src`, `n`) or (`dst`, `n`) in `graph` or the
         minumum of the two when both exist.
 
     """