Mercurial > repos > guerler > springsuite

comparison planemo/lib/python3.7/site-packages/networkx/__init__.py @ 1:56ad4e20f292 draft

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
"planemo upload commit 6eee67778febed82ddd413c3ca40b3183a3898f1"
author guerler
date Fri, 31 Jul 2020 00:32:28 -0400
parents
children
comparison
equal deleted inserted replaced
0:d30785e31577 1:56ad4e20f292
1 """
2 NetworkX
3 ========
4
5 NetworkX is a Python package for the creation, manipulation,
6 and study of the structure, dynamics, and functions
7 of complex networks.
8
9 Website (including documentation)::
10
11 http://networkx.github.io
12
13 Mailing list::
14
15 https://groups.google.com/forum/#!forum/networkx-discuss
16
17 Source::
18
19 https://github.com/networkx/networkx
20
21 Bug reports::
22
23 https://github.com/networkx/networkx/issues
24
25 Simple example
26 --------------
27
28 Find the shortest path between two nodes in an undirected graph::
29
30 >>> import networkx as nx
31 >>> G = nx.Graph()
32 >>> G.add_edge('A', 'B', weight=4)
33 >>> G.add_edge('B', 'D', weight=2)
34 >>> G.add_edge('A', 'C', weight=3)
35 >>> G.add_edge('C', 'D', weight=4)
36 >>> nx.shortest_path(G, 'A', 'D', weight='weight')
37 ['A', 'B', 'D']
38
39 Bugs
40 ----
41
42 Please report any bugs that you find `here <https://github.com/networkx/networkx/issues>`_.
43 Or, even better, fork the repository on GitHub and create a pull request (PR).
44
45 License
46 -------
47
48 Released under the 3-Clause BSD license::
49
50 Copyright (C) 2004-2019 NetworkX Developers
51 Aric Hagberg <hagberg@lanl.gov>
52 Dan Schult <dschult@colgate.edu>
53 Pieter Swart <swart@lanl.gov>
54 """
55 # Copyright (C) 2004-2019 by
56 # Aric Hagberg <hagberg@lanl.gov>
57 # Dan Schult <dschult@colgate.edu>
58 # Pieter Swart <swart@lanl.gov>
59 # All rights reserved.
60 # BSD license.
61 #
62 # Add platform dependent shared library path to sys.path
63 #
64
65 import sys
66 if sys.version_info[:2] < (3, 5):
67 m = "Python 3.5 or later is required for NetworkX (%d.%d detected)."
68 raise ImportError(m % sys.version_info[:2])
69 del sys
70
71 # Release data
72 from networkx import release
73
74 __author__ = '%s <%s>\n%s <%s>\n%s <%s>' % \
75 (release.authors['Hagberg'] + release.authors['Schult'] +
76 release.authors['Swart'])
77 __license__ = release.license
78
79 __date__ = release.date
80 __version__ = release.version
81
82 __bibtex__ = """@inproceedings{hagberg-2008-exploring,
83 author = {Aric A. Hagberg and Daniel A. Schult and Pieter J. Swart},
84 title = {Exploring network structure, dynamics, and function using {NetworkX}},
85 year = {2008},
86 month = Aug,
87 urlpdf = {http://math.lanl.gov/~hagberg/Papers/hagberg-2008-exploring.pdf},
88 booktitle = {Proceedings of the 7th Python in Science Conference (SciPy2008)},
89 editors = {G\"{a}el Varoquaux, Travis Vaught, and Jarrod Millman},
90 address = {Pasadena, CA USA},
91 pages = {11--15}
92 }"""
93
94 # These are import orderwise
95 from networkx.exception import *
96 import networkx.utils
97
98 import networkx.classes.filters
99 import networkx.classes
100 from networkx.classes import *
101
102 import networkx.convert
103 from networkx.convert import *
104
105 import networkx.convert_matrix
106 from networkx.convert_matrix import *
107
108
109 import networkx.relabel
110 from networkx.relabel import *
111
112 import networkx.generators
113 from networkx.generators import *
114
115 import networkx.readwrite
116 from networkx.readwrite import *
117
118 # Need to test with SciPy, when available
119 import networkx.algorithms
120 from networkx.algorithms import *
121 import networkx.linalg
122
123 from networkx.linalg import *
124 from networkx.testing.test import run as test
125
126 import networkx.drawing
127 from networkx.drawing import *