This commit is contained in:
Vighnesh Birodkar
2014-07-02 00:31:01 +05:30
parent 99a45baca8
commit 6003ab2c7d
2 changed files with 2 additions and 2 deletions
+1 -1
View File
@@ -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`.
+1 -1
View File
@@ -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.
"""