Hello community, here is the log from the commit of package python-networkx for openSUSE:Factory checked in at 2014-11-02 16:46:18 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/python-networkx (Old) and /work/SRC/openSUSE:Factory/.python-networkx.new (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "python-networkx" Changes: -------- --- /work/SRC/openSUSE:Factory/python-networkx/python-networkx.changes 2014-10-25 11:16:41.000000000 +0200 +++ /work/SRC/openSUSE:Factory/.python-networkx.new/python-networkx.changes 2014-11-02 16:46:34.000000000 +0100 @@ -1,0 +2,8 @@ +Thu Oct 30 10:46:52 UTC 2014 - [email protected] + +- update to version 1.9.1: + * Bugfix release for minor installation and documentation issues +- Don't BuildRequire/Recommend matplotlib and scipy on SLE11 + and SLE12. Both are not available there. + +------------------------------------------------------------------- Old: ---- networkx-1.9.tar.gz New: ---- networkx-1.9.1.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ python-networkx.spec ++++++ --- /var/tmp/diff_new_pack.dAICK6/_old 2014-11-02 16:46:36.000000000 +0100 +++ /var/tmp/diff_new_pack.dAICK6/_new 2014-11-02 16:46:36.000000000 +0100 @@ -17,7 +17,7 @@ Name: python-networkx -Version: 1.9 +Version: 1.9.1 Release: 0 Summary: Python package for the creation, manipulation, License: BSD-3-Clause @@ -26,23 +26,28 @@ Source: http://pypi.python.org/packages/source/n/networkx/networkx-%{version}.tar.gz BuildRequires: fdupes BuildRequires: python-PyYAML -BuildRequires: python-devel BuildRequires: python-decorator >= 3.4.0 -BuildRequires: python-matplotlib +BuildRequires: python-devel BuildRequires: python-numpy-devel BuildRequires: python-pydot BuildRequires: python-pygraphviz BuildRequires: python-pyparsing -BuildRequires: python-scipy BuildRequires: python-setuptools +#don't use non available deps on SLES +%if 0%{?suse_version} && 0%{?suse_version} != 1110 && 0%{?suse_version} != 1315 +BuildRequires: python-matplotlib +BuildRequires: python-scipy +%endif Requires: python-decorator >= 3.4.0 -Recommends: python-matplotlib -Recommends: python-numpy Recommends: python-pydot Recommends: python-pygraphviz Recommends: python-PyYAML Recommends: python-pyparsing +Recommends: python-numpy +%if 0%{?suse_version} && 0%{?suse_version} != 1110 && 0%{?suse_version} != 1315 +Recommends: python-matplotlib Recommends: python-scipy +%endif BuildRoot: %{_tmppath}/%{name}-%{version}-build %if 0%{?suse_version} && 0%{?suse_version} <= 1110 %{!?python_sitelib: %global python_sitelib %(python -c "from distutils.sysconfig import get_python_lib; print get_python_lib()")} ++++++ networkx-1.9.tar.gz -> networkx-1.9.1.tar.gz ++++++ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/PKG-INFO new/networkx-1.9.1/PKG-INFO --- old/networkx-1.9/PKG-INFO 2014-06-25 20:07:18.000000000 +0200 +++ new/networkx-1.9.1/PKG-INFO 2014-09-21 00:34:37.000000000 +0200 @@ -1,6 +1,6 @@ Metadata-Version: 1.1 Name: networkx -Version: 1.9 +Version: 1.9.1 Summary: Python package for creating and manipulating graphs and networks Home-page: http://networkx.github.io/ Author: NetworkX Developers diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/doc/source/conf.py new/networkx-1.9.1/doc/source/conf.py --- old/networkx-1.9/doc/source/conf.py 2014-06-25 19:50:57.000000000 +0200 +++ new/networkx-1.9.1/doc/source/conf.py 2014-09-20 21:07:26.000000000 +0200 @@ -175,6 +175,6 @@ default_role = 'math' trac_url = 'https://networkx.lanl.gov/trac/' -mathjax_path = 'https://c328740.ssl.cf1.rackcdn.com/mathjax/latest/MathJax.js?config=TeX-AMS_HTML' +mathjax_path = 'https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS_HTML' numpydoc_show_class_members = False diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/doc/source/reference/algorithms.dominating.rst new/networkx-1.9.1/doc/source/reference/algorithms.dominating.rst --- old/networkx-1.9/doc/source/reference/algorithms.dominating.rst 1970-01-01 01:00:00.000000000 +0100 +++ new/networkx-1.9.1/doc/source/reference/algorithms.dominating.rst 2014-09-20 21:07:50.000000000 +0200 @@ -0,0 +1,10 @@ +*************** +Dominating Sets +*************** + +.. automodule:: networkx.algorithms.dominating +.. autosummary:: + :toctree: generated/ + + dominating_set + is_dominating_set diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/doc/source/reference/algorithms.rst new/networkx-1.9.1/doc/source/reference/algorithms.rst --- old/networkx-1.9/doc/source/reference/algorithms.rst 2014-06-25 20:02:09.000000000 +0200 +++ new/networkx-1.9.1/doc/source/reference/algorithms.rst 2014-09-20 21:07:50.000000000 +0200 @@ -26,6 +26,7 @@ algorithms.dag algorithms.distance_measures algorithms.distance_regular + algorithms.dominating algorithms.euler algorithms.flow algorithms.graphical diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/doc/source/reference/news.rst new/networkx-1.9.1/doc/source/reference/news.rst --- old/networkx-1.9/doc/source/reference/news.rst 2014-06-25 20:02:09.000000000 +0200 +++ new/networkx-1.9.1/doc/source/reference/news.rst 2014-09-20 21:07:50.000000000 +0200 @@ -4,6 +4,14 @@ Release Log =========== +NetworkX 1.9.1 +-------------- +Release date: 13 September 2014 + +Bugfix release for minor installation and documentation issues. + +https://github.com/networkx/networkx/milestones/networkx-1.9.1 + NetworkX 1.9 ------------ Release date: 21 June 2014 @@ -31,7 +39,7 @@ -------------- Release date: 4 August 2013 -Bugfix release for missing files in source packaging +Bugfix release for missing files in source packaging. NetworkX 1.8 diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/doc/source/templates/index.html new/networkx-1.9.1/doc/source/templates/index.html --- old/networkx-1.9/doc/source/templates/index.html 2014-06-25 19:50:58.000000000 +0200 +++ new/networkx-1.9.1/doc/source/templates/index.html 2014-09-20 21:07:50.000000000 +0200 @@ -1,8 +1,5 @@ {% extends "layout.html" %} {% set title = 'Overview' %} -{% set script_files = script_files + ["_static/force/d3js/d3.min.js"] %} -{% set script_files = script_files + ["_static/force/d3js/d3.geom.min.js"] %} -{% set script_files = script_files + ["_static/force/d3js/d3.layout.min.js"] %} {% set css_files = css_files + ["_static/force/force.css"] %} {% block body %} @@ -33,6 +30,7 @@ </td> <td width="50%"> <div id="chart"></div> + <script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/d3/3.4.11/d3.min.js";></script> <script type="text/javascript" src="_static/force/force.js"></script> </td></tr> </blockquote> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/examples/algorithms/rcm.py new/networkx-1.9.1/examples/algorithms/rcm.py --- old/networkx-1.9/examples/algorithms/rcm.py 2014-06-25 19:50:58.000000000 +0200 +++ new/networkx-1.9.1/examples/algorithms/rcm.py 2014-09-20 21:07:26.000000000 +0200 @@ -12,7 +12,7 @@ # build low-bandwidth numpy matrix G=nx.grid_2d_graph(3,3) rcm = list(reverse_cuthill_mckee_ordering(G)) -print "ordering",rcm +print("ordering",rcm) print("unordered Laplacian matrix") A = nx.laplacian_matrix(G) @@ -20,7 +20,7 @@ #print("lower bandwidth:",(y-x).max()) #print("upper bandwidth:",(x-y).max()) print("bandwidth: %d"%((y-x).max()+(x-y).max()+1)) -print A +print(A) B = nx.laplacian_matrix(G,nodelist=rcm) print("low-bandwidth Laplacian matrix") @@ -28,5 +28,5 @@ #print("lower bandwidth:",(y-x).max()) #print("upper bandwidth:",(x-y).max()) print("bandwidth: %d"%((y-x).max()+(x-y).max()+1)) -print B +print(B) diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/examples/drawing/giant_component.py new/networkx-1.9.1/examples/drawing/giant_component.py --- old/networkx-1.9/examples/drawing/giant_component.py 2014-06-25 19:50:58.000000000 +0200 +++ new/networkx-1.9.1/examples/drawing/giant_component.py 2014-09-20 21:07:26.000000000 +0200 @@ -25,7 +25,7 @@ from networkx import graphviz_layout layout=nx.graphviz_layout except ImportError: - print "PyGraphviz not found; drawing with spring layout; will be slow." + print("PyGraphviz not found; drawing with spring layout; will be slow.") layout=nx.spring_layout diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/examples/drawing/lanl_routes.py new/networkx-1.9.1/examples/drawing/lanl_routes.py --- old/networkx-1.9/examples/drawing/lanl_routes.py 2014-06-25 19:50:58.000000000 +0200 +++ new/networkx-1.9.1/examples/drawing/lanl_routes.py 2014-09-20 21:07:26.000000000 +0200 @@ -21,7 +21,7 @@ try: fh=open('lanl_routes.edgelist','r') except IOError: - print "lanl.edges not found" + print("lanl.edges not found") raise G=nx.Graph() @@ -52,9 +52,9 @@ G=lanl_graph() - print "graph has %d nodes with %d edges"\ - %(nx.number_of_nodes(G),nx.number_of_edges(G)) - print nx.number_connected_components(G),"connected components" + print("graph has %d nodes with %d edges"\ + %(nx.number_of_nodes(G),nx.number_of_edges(G))) + print(nx.number_connected_components(G),"connected components") import matplotlib.pyplot as plt plt.figure(figsize=(8,8)) diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/examples/graph/degree_sequence.py new/networkx-1.9.1/examples/graph/degree_sequence.py --- old/networkx-1.9/examples/graph/degree_sequence.py 2014-06-25 19:50:58.000000000 +0200 +++ new/networkx-1.9.1/examples/graph/degree_sequence.py 2014-09-20 21:07:26.000000000 +0200 @@ -16,7 +16,7 @@ from networkx import * z=[5,3,3,3,3,2,2,2,1,1,1] -print is_valid_degree_sequence(z) +print(is_valid_degree_sequence(z)) print("Configuration model") G=configuration_model(z) # configuration model @@ -32,5 +32,3 @@ print("degree #nodes") for d in hist: print('%d %d' % (d,hist[d])) - - diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/examples/pygraphviz/write_dotfile.py new/networkx-1.9.1/examples/pygraphviz/write_dotfile.py --- old/networkx-1.9/examples/pygraphviz/write_dotfile.py 2014-06-25 19:50:58.000000000 +0200 +++ new/networkx-1.9.1/examples/pygraphviz/write_dotfile.py 2014-09-20 21:07:26.000000000 +0200 @@ -23,15 +23,15 @@ try: m=NX.drawing.write_dot.__module__ except: - print - print "pygraphviz or pydot were not found " - print "see https://networkx.lanl.gov/Drawing.html for info" - print + print() + print("pygraphviz or pydot were not found ") + print("see https://networkx.lanl.gov/Drawing.html for info") + print() raise -print "using module", m +print("using module", m) G=NX.grid_2d_graph(5,5) # 5x5 grid NX.write_dot(G,"grid.dot") -print "Now run: neato -Tps grid.dot >grid.ps" +print("Now run: neato -Tps grid.dot >grid.ps") diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/networkx/algorithms/components/connected.py new/networkx-1.9.1/networkx/algorithms/components/connected.py --- old/networkx-1.9/networkx/algorithms/components/connected.py 2014-06-25 19:50:58.000000000 +0200 +++ new/networkx-1.9.1/networkx/algorithms/components/connected.py 2014-09-20 21:07:26.000000000 +0200 @@ -66,14 +66,14 @@ G : NetworkX graph An undirected graph. + copy: bool (default=True) + If True make a copy of the graph attributes + Returns ------- comp : generator A generator of graphs, one for each connected component of G. - copy: bool (default=True) - If True make a copy of the graph attributes - Examples -------- >>> G = nx.path_graph(4) diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/networkx/algorithms/components/strongly_connected.py new/networkx-1.9.1/networkx/algorithms/components/strongly_connected.py --- old/networkx-1.9/networkx/algorithms/components/strongly_connected.py 2014-06-25 19:50:58.000000000 +0200 +++ new/networkx-1.9.1/networkx/algorithms/components/strongly_connected.py 2014-09-20 21:07:26.000000000 +0200 @@ -112,11 +112,10 @@ ------- comp : generator of lists A list of nodes for each component of G. - The list is ordered from largest connected component to smallest. Raises ------ - NetworkXNotImplemented: If G is undirected + NetworkXNotImplemented: If G is undirected. See Also -------- diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/networkx/algorithms/dominating.py new/networkx-1.9.1/networkx/algorithms/dominating.py --- old/networkx-1.9/networkx/algorithms/dominating.py 2014-06-25 19:50:58.000000000 +0200 +++ new/networkx-1.9.1/networkx/algorithms/dominating.py 2014-09-20 21:07:50.000000000 +0200 @@ -25,7 +25,7 @@ Notes ----- - This function is an implementation of algorithm 7 in _[2] which + This function is an implementation of algorithm 7 in [2]_ which finds some dominating set, not necessarily the smallest one. See also diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/networkx/algorithms/flow/capacityscaling.py new/networkx-1.9.1/networkx/algorithms/flow/capacityscaling.py --- old/networkx-1.9/networkx/algorithms/flow/capacityscaling.py 2014-06-25 19:50:58.000000000 +0200 +++ new/networkx-1.9.1/networkx/algorithms/flow/capacityscaling.py 2014-09-20 21:07:50.000000000 +0200 @@ -40,7 +40,7 @@ if nx.negative_edge_cycle(G): raise nx.NetworkXUnbounded( 'Negative cost cycle of infinite capacity found. ' - 'Min cost flow unbounded below.') + 'Min cost flow may be unbounded below.') @not_implemented_for('undirected') @@ -60,7 +60,7 @@ if e.get(weight, 0) < 0 and e.get(capacity, inf) == inf: raise nx.NetworkXUnbounded( 'Negative cost cycle of infinite capacity found. ' - 'Min cost flow bounded below.') + 'Min cost flow may be unbounded below.') # Extract edges with positive capacities. Self loops excluded. if G.is_multigraph(): @@ -193,7 +193,7 @@ ------ NetworkXError This exception is raised if the input graph is not directed, - not connected or is a multigraph. + not connected. NetworkXUnfeasible This exception is raised in the following situations: diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/networkx/release.py new/networkx-1.9.1/networkx/release.py --- old/networkx-1.9/networkx/release.py 2014-06-25 20:02:09.000000000 +0200 +++ new/networkx-1.9.1/networkx/release.py 2014-09-20 21:07:50.000000000 +0200 @@ -201,7 +201,7 @@ ## Version information name = 'networkx' major = "1" -minor = "9" +minor = "9.1" ## Declare current release as a development release. diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/networkx/version.py new/networkx-1.9.1/networkx/version.py --- old/networkx-1.9/networkx/version.py 2014-06-25 20:02:42.000000000 +0200 +++ new/networkx-1.9.1/networkx/version.py 2014-09-20 21:09:35.000000000 +0200 @@ -7,18 +7,18 @@ import datetime -version = '1.9' -date = 'Wed Jun 25 12:02:42 2014' +version = '1.9.1' +date = 'Sat Sep 20 13:09:35 2014' # Was NetworkX built from a development version? If so, remember that the major # and minor versions reference the "target" (rather than "current") release. dev = False # Format: (name, major, min, revision) -version_info = ('networkx', '1', '9', None) +version_info = ('networkx', '1', '9.1', None) # Format: a 'datetime.datetime' instance -date_info = datetime.datetime(2014, 6, 25, 12, 2, 42, 340629) +date_info = datetime.datetime(2014, 9, 20, 13, 9, 35, 734061) # Format: (vcs, vcs_tuple) vcs_info = (None, (None, None)) diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/networkx.egg-info/PKG-INFO new/networkx-1.9.1/networkx.egg-info/PKG-INFO --- old/networkx-1.9/networkx.egg-info/PKG-INFO 2014-06-25 20:07:18.000000000 +0200 +++ new/networkx-1.9.1/networkx.egg-info/PKG-INFO 2014-09-21 00:34:37.000000000 +0200 @@ -1,6 +1,6 @@ Metadata-Version: 1.1 Name: networkx -Version: 1.9 +Version: 1.9.1 Summary: Python package for creating and manipulating graphs and networks Home-page: http://networkx.github.io/ Author: NetworkX Developers diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/networkx-1.9/networkx.egg-info/SOURCES.txt new/networkx-1.9.1/networkx.egg-info/SOURCES.txt --- old/networkx-1.9/networkx.egg-info/SOURCES.txt 2014-06-25 20:07:18.000000000 +0200 +++ new/networkx-1.9.1/networkx.egg-info/SOURCES.txt 2014-09-21 00:34:37.000000000 +0200 @@ -53,6 +53,7 @@ doc/source/reference/algorithms.dag.rst doc/source/reference/algorithms.distance_measures.rst doc/source/reference/algorithms.distance_regular.rst +doc/source/reference/algorithms.dominating.rst doc/source/reference/algorithms.euler.rst doc/source/reference/algorithms.flow.rst doc/source/reference/algorithms.graphical.rst -- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
