ó ,µ[c@@s¬dZddlmZddlZejd dkrUdZeeejd ƒ‚n[ddlmZdej d ej d ej d Z ej Z ej ZejZd Zdd lTddlZddlZddlZdd lTddlZdd lTddlZdd lTddlZdd lTddlZdd lTddlZdd lTddlZdd lTddlZdd lTddlmZddl Zdd l TdS(sª NetworkX ======== NetworkX is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks. Website (including documentation):: http://networkx.github.io Mailing list:: https://groups.google.com/forum/#!forum/networkx-discuss Source:: https://github.com/networkx/networkx Bug reports:: https://github.com/networkx/networkx/issues Simple example -------------- Find the shortest path between two nodes in an undirected graph:: >>> import networkx as nx >>> G = nx.Graph() >>> G.add_edge('A', 'B', weight=4) >>> G.add_edge('B', 'D', weight=2) >>> G.add_edge('A', 'C', weight=3) >>> G.add_edge('C', 'D', weight=4) >>> nx.shortest_path(G, 'A', 'D', weight='weight') ['A', 'B', 'D'] Bugs ---- Please report any bugs that you find `here `_. Or, even better, fork the repository on GitHub and create a pull request (PR). License ------- Released under the 3-Clause BSD license:: Copyright (C) 2004-2018 NetworkX Developers Aric Hagberg Dan Schult Pieter Swart i(tabsolute_importNiis>Python 2.7 or later is required for NetworkX (%d.%d detected).(treleases%s <%s> %s <%s> %s <%s>tHagbergtSchulttSwartså@inproceedings{hagberg-2008-exploring, author = {Aric A. Hagberg and Daniel A. Schult and Pieter J. Swart}, title = {Exploring network structure, dynamics, and function using {NetworkX}}, year = {2008}, month = Aug, urlpdf = {http://math.lanl.gov/~hagberg/Papers/hagberg-2008-exploring.pdf}, booktitle = {Proceedings of the 7th Python in Science Conference (SciPy2008)}, editors = {G"{a}el Varoquaux, Travis Vaught, and Jarrod Millman}, address = {Pasadena, CA USA}, pages = {11--15} }(t*(trun(ii(!t__doc__t __future__Rtsyst version_infotmt ImportErrortnetworkxRtauthorst __author__tlicenset __license__tdatet__date__tversiont __version__t __bibtex__tnetworkx.exceptiontnetworkx.utilstnetworkx.classes.filterstnetworkx.classestnetworkx.converttnetworkx.convert_matrixtnetworkx.relabeltnetworkx.generatorstnetworkx.readwritetnetworkx.algorithmstnetworkx.linalgtnetworkx.tests.testRttesttnetworkx.drawing(((s0lib/python2.7/site-packages/networkx/__init__.pyt6sH