METADATA 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136
  1. Metadata-Version: 2.1
  2. Name: networkx
  3. Version: 3.1
  4. Summary: Python package for creating and manipulating graphs and networks
  5. Home-page: https://networkx.org/
  6. Author: Aric Hagberg
  7. Author-email: hagberg@lanl.gov
  8. Maintainer: NetworkX Developers
  9. Maintainer-email: networkx-discuss@googlegroups.com
  10. Project-URL: Bug Tracker, https://github.com/networkx/networkx/issues
  11. Project-URL: Documentation, https://networkx.org/documentation/stable/
  12. Project-URL: Source Code, https://github.com/networkx/networkx
  13. Keywords: Networks,Graph Theory,Mathematics,network,graph,discrete mathematics,math
  14. Platform: Linux
  15. Platform: Mac OSX
  16. Platform: Windows
  17. Platform: Unix
  18. Classifier: Development Status :: 5 - Production/Stable
  19. Classifier: Intended Audience :: Developers
  20. Classifier: Intended Audience :: Science/Research
  21. Classifier: License :: OSI Approved :: BSD License
  22. Classifier: Operating System :: OS Independent
  23. Classifier: Programming Language :: Python :: 3
  24. Classifier: Programming Language :: Python :: 3.8
  25. Classifier: Programming Language :: Python :: 3.9
  26. Classifier: Programming Language :: Python :: 3.10
  27. Classifier: Programming Language :: Python :: 3.11
  28. Classifier: Programming Language :: Python :: 3 :: Only
  29. Classifier: Topic :: Software Development :: Libraries :: Python Modules
  30. Classifier: Topic :: Scientific/Engineering :: Bio-Informatics
  31. Classifier: Topic :: Scientific/Engineering :: Information Analysis
  32. Classifier: Topic :: Scientific/Engineering :: Mathematics
  33. Classifier: Topic :: Scientific/Engineering :: Physics
  34. Requires-Python: >=3.8
  35. License-File: LICENSE.txt
  36. Provides-Extra: default
  37. Requires-Dist: numpy (>=1.20) ; extra == 'default'
  38. Requires-Dist: scipy (>=1.8) ; extra == 'default'
  39. Requires-Dist: matplotlib (>=3.4) ; extra == 'default'
  40. Requires-Dist: pandas (>=1.3) ; extra == 'default'
  41. Provides-Extra: developer
  42. Requires-Dist: pre-commit (>=3.2) ; extra == 'developer'
  43. Requires-Dist: mypy (>=1.1) ; extra == 'developer'
  44. Provides-Extra: doc
  45. Requires-Dist: sphinx (>=6.1) ; extra == 'doc'
  46. Requires-Dist: pydata-sphinx-theme (>=0.13) ; extra == 'doc'
  47. Requires-Dist: sphinx-gallery (>=0.12) ; extra == 'doc'
  48. Requires-Dist: numpydoc (>=1.5) ; extra == 'doc'
  49. Requires-Dist: pillow (>=9.4) ; extra == 'doc'
  50. Requires-Dist: nb2plots (>=0.6) ; extra == 'doc'
  51. Requires-Dist: texext (>=0.6.7) ; extra == 'doc'
  52. Provides-Extra: extra
  53. Requires-Dist: lxml (>=4.6) ; extra == 'extra'
  54. Requires-Dist: pygraphviz (>=1.10) ; extra == 'extra'
  55. Requires-Dist: pydot (>=1.4.2) ; extra == 'extra'
  56. Requires-Dist: sympy (>=1.10) ; extra == 'extra'
  57. Provides-Extra: test
  58. Requires-Dist: pytest (>=7.2) ; extra == 'test'
  59. Requires-Dist: pytest-cov (>=4.0) ; extra == 'test'
  60. Requires-Dist: codecov (>=2.1) ; extra == 'test'
  61. NetworkX
  62. ========
  63. `NetworkX Survey 2023!! <https://forms.gle/NUGcBxyjx5onbAgc8>`_ 🎉 Fill out the survey to tell us about your ideas, complaints, praises of NetworkX!
  64. .. image:: https://github.com/networkx/networkx/workflows/test/badge.svg?tag=networkx-3.1
  65. :target: https://github.com/networkx/networkx/actions?query=branch%3Anetworkx-3.1
  66. .. image:: https://codecov.io/gh/networkx/networkx/branch/main/graph/badge.svg
  67. :target: https://app.codecov.io/gh/networkx/networkx/branch/main
  68. .. image:: https://img.shields.io/github/labels/networkx/networkx/Good%20First%20Issue?color=green&label=Contribute%20&style=flat-square
  69. :target: https://github.com/networkx/networkx/issues?q=is%3Aopen+is%3Aissue+label%3A%22Good+First+Issue%22
  70. NetworkX is a Python package for the creation, manipulation,
  71. and study of the structure, dynamics, and functions
  72. of complex networks.
  73. - **Website (including documentation):** https://networkx.org
  74. - **Mailing list:** https://groups.google.com/forum/#!forum/networkx-discuss
  75. - **Source:** https://github.com/networkx/networkx
  76. - **Bug reports:** https://github.com/networkx/networkx/issues
  77. - **Report a security vulnerability:** https://tidelift.com/security
  78. - **Tutorial:** https://networkx.org/documentation/latest/tutorial.html
  79. - **GitHub Discussions:** https://github.com/networkx/networkx/discussions
  80. Simple example
  81. --------------
  82. Find the shortest path between two nodes in an undirected graph:
  83. .. code:: pycon
  84. >>> import networkx as nx
  85. >>> G = nx.Graph()
  86. >>> G.add_edge("A", "B", weight=4)
  87. >>> G.add_edge("B", "D", weight=2)
  88. >>> G.add_edge("A", "C", weight=3)
  89. >>> G.add_edge("C", "D", weight=4)
  90. >>> nx.shortest_path(G, "A", "D", weight="weight")
  91. ['A', 'B', 'D']
  92. Install
  93. -------
  94. Install the latest version of NetworkX::
  95. $ pip install networkx
  96. Install with all optional dependencies::
  97. $ pip install networkx[all]
  98. For additional details, please see `INSTALL.rst`.
  99. Bugs
  100. ----
  101. Please report any bugs that you find `here <https://github.com/networkx/networkx/issues>`_.
  102. Or, even better, fork the repository on `GitHub <https://github.com/networkx/networkx>`_
  103. and create a pull request (PR). We welcome all changes, big or small, and we
  104. will help you make the PR if you are new to `git` (just ask on the issue and/or
  105. see `CONTRIBUTING.rst`).
  106. License
  107. -------
  108. Released under the 3-Clause BSD license (see `LICENSE.txt`)::
  109. Copyright (C) 2004-2023 NetworkX Developers
  110. Aric Hagberg <hagberg@lanl.gov>
  111. Dan Schult <dschult@colgate.edu>
  112. Pieter Swart <swart@lanl.gov>