[Python-modules-commits] r16749 - in packages/python-networkx/trunk/debian (changelog control)

[morph at users.alioth.debian.org]

    Date: Sunday, April 24, 2011 @ 15:04:31
  Author: morph
Revision: 16749

don't use 'we' in long description

Modified:
  packages/python-networkx/trunk/debian/changelog
  packages/python-networkx/trunk/debian/control

Modified: packages/python-networkx/trunk/debian/changelog
===================================================================
--- packages/python-networkx/trunk/debian/changelog	2011-04-24 14:51:55 UTC (rev 16748)
+++ packages/python-networkx/trunk/debian/changelog	2011-04-24 15:04:31 UTC (rev 16749)
@@ -4,8 +4,9 @@
     - write a description for this patch
   * debian/control
     - bump Standards-Version to 3.9.2 (no changes needed)
+    - don't use 'we' in long description
 
- -- Sandro Tosi <morph at debian.org>  Sun, 24 Apr 2011 16:51:40 +0200
+ -- Sandro Tosi <morph at debian.org>  Sun, 24 Apr 2011 17:03:42 +0200
 
 python-networkx (1.4-1) experimental; urgency=low
 

Modified: packages/python-networkx/trunk/debian/control
===================================================================
--- packages/python-networkx/trunk/debian/control	2011-04-24 14:51:55 UTC (rev 16748)
+++ packages/python-networkx/trunk/debian/control	2011-04-24 15:04:31 UTC (rev 16749)
@@ -21,9 +21,9 @@
  .
  The structure of a graph or network is encoded in the edges (connections,
  links, ties, arcs, bonds) between nodes (vertices, sites, actors). If
- unqualified, by graph we mean a simple undirected graph, i.e. no
- self-loops and no multiple edges are allowed. By a network we usually
- mean a graph with weights (fields, properties) on nodes and/or edges.
+ unqualified, by graph it's meant a simple undirected graph, i.e. no
+ self-loops and no multiple edges are allowed. By a network it's usually
+ meant a graph with weights (fields, properties) on nodes and/or edges.
  .
  The potential audience for NetworkX includes: mathematicians, physicists,
  biologists, computer scientists, social scientists.
@@ -38,9 +38,9 @@
  .
  The structure of a graph or network is encoded in the edges (connections,
  links, ties, arcs, bonds) between nodes (vertices, sites, actors). If
- unqualified, by graph we mean a simple undirected graph, i.e. no
- self-loops and no multiple edges are allowed. By a network we usually
- mean a graph with weights (fields, properties) on nodes and/or edges.
+ unqualified, by graph it's meant a simple undirected graph, i.e. no
+ self-loops and no multiple edges are allowed. By a network it's usually
+ meant a graph with weights (fields, properties) on nodes and/or edges.
  .
  The potential audience for NetworkX includes: mathematicians, physicists,
  biologists, computer scientists, social scientists.