From 6003ab2c7dd14361084676f3e0d7cd6d2ed13b34 Mon Sep 17 00:00:00 2001 From: Vighnesh Birodkar Date: Wed, 2 Jul 2014 00:31:01 +0530 Subject: [PATCH] Typos --- doc/examples/plot_rag.py | 2 +- skimage/graph/rag.py | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) 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. """