rm CondaPkg environment

This commit is contained in:
ton
2023-04-06 13:53:47 +07:00
parent 0a57ed7884
commit c43d949309
3329 changed files with 5725 additions and 447022 deletions

View File

@@ -0,0 +1 @@
pip

View File

@@ -0,0 +1,37 @@
NetworkX is distributed with the 3-clause BSD license.
::
Copyright (C) 2004-2023, NetworkX Developers
Aric Hagberg <hagberg@lanl.gov>
Dan Schult <dschult@colgate.edu>
Pieter Swart <swart@lanl.gov>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the NetworkX Developers nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

View File

@@ -0,0 +1,136 @@
Metadata-Version: 2.1
Name: networkx
Version: 3.1
Summary: Python package for creating and manipulating graphs and networks
Home-page: https://networkx.org/
Author: Aric Hagberg
Author-email: hagberg@lanl.gov
Maintainer: NetworkX Developers
Maintainer-email: networkx-discuss@googlegroups.com
Project-URL: Bug Tracker, https://github.com/networkx/networkx/issues
Project-URL: Documentation, https://networkx.org/documentation/stable/
Project-URL: Source Code, https://github.com/networkx/networkx
Keywords: Networks,Graph Theory,Mathematics,network,graph,discrete mathematics,math
Platform: Linux
Platform: Mac OSX
Platform: Windows
Platform: Unix
Classifier: Development Status :: 5 - Production/Stable
Classifier: Intended Audience :: Developers
Classifier: Intended Audience :: Science/Research
Classifier: License :: OSI Approved :: BSD License
Classifier: Operating System :: OS Independent
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.8
Classifier: Programming Language :: Python :: 3.9
Classifier: Programming Language :: Python :: 3.10
Classifier: Programming Language :: Python :: 3.11
Classifier: Programming Language :: Python :: 3 :: Only
Classifier: Topic :: Software Development :: Libraries :: Python Modules
Classifier: Topic :: Scientific/Engineering :: Bio-Informatics
Classifier: Topic :: Scientific/Engineering :: Information Analysis
Classifier: Topic :: Scientific/Engineering :: Mathematics
Classifier: Topic :: Scientific/Engineering :: Physics
Requires-Python: >=3.8
License-File: LICENSE.txt
Provides-Extra: default
Requires-Dist: numpy (>=1.20) ; extra == 'default'
Requires-Dist: scipy (>=1.8) ; extra == 'default'
Requires-Dist: matplotlib (>=3.4) ; extra == 'default'
Requires-Dist: pandas (>=1.3) ; extra == 'default'
Provides-Extra: developer
Requires-Dist: pre-commit (>=3.2) ; extra == 'developer'
Requires-Dist: mypy (>=1.1) ; extra == 'developer'
Provides-Extra: doc
Requires-Dist: sphinx (>=6.1) ; extra == 'doc'
Requires-Dist: pydata-sphinx-theme (>=0.13) ; extra == 'doc'
Requires-Dist: sphinx-gallery (>=0.12) ; extra == 'doc'
Requires-Dist: numpydoc (>=1.5) ; extra == 'doc'
Requires-Dist: pillow (>=9.4) ; extra == 'doc'
Requires-Dist: nb2plots (>=0.6) ; extra == 'doc'
Requires-Dist: texext (>=0.6.7) ; extra == 'doc'
Provides-Extra: extra
Requires-Dist: lxml (>=4.6) ; extra == 'extra'
Requires-Dist: pygraphviz (>=1.10) ; extra == 'extra'
Requires-Dist: pydot (>=1.4.2) ; extra == 'extra'
Requires-Dist: sympy (>=1.10) ; extra == 'extra'
Provides-Extra: test
Requires-Dist: pytest (>=7.2) ; extra == 'test'
Requires-Dist: pytest-cov (>=4.0) ; extra == 'test'
Requires-Dist: codecov (>=2.1) ; extra == 'test'
NetworkX
========
`NetworkX Survey 2023!! <https://forms.gle/NUGcBxyjx5onbAgc8>`_ 🎉 Fill out the survey to tell us about your ideas, complaints, praises of NetworkX!
.. image:: https://github.com/networkx/networkx/workflows/test/badge.svg?tag=networkx-3.1
:target: https://github.com/networkx/networkx/actions?query=branch%3Anetworkx-3.1
.. image:: https://codecov.io/gh/networkx/networkx/branch/main/graph/badge.svg
:target: https://app.codecov.io/gh/networkx/networkx/branch/main
.. image:: https://img.shields.io/github/labels/networkx/networkx/Good%20First%20Issue?color=green&label=Contribute%20&style=flat-square
:target: https://github.com/networkx/networkx/issues?q=is%3Aopen+is%3Aissue+label%3A%22Good+First+Issue%22
NetworkX is a Python package for the creation, manipulation,
and study of the structure, dynamics, and functions
of complex networks.
- **Website (including documentation):** https://networkx.org
- **Mailing list:** https://groups.google.com/forum/#!forum/networkx-discuss
- **Source:** https://github.com/networkx/networkx
- **Bug reports:** https://github.com/networkx/networkx/issues
- **Report a security vulnerability:** https://tidelift.com/security
- **Tutorial:** https://networkx.org/documentation/latest/tutorial.html
- **GitHub Discussions:** https://github.com/networkx/networkx/discussions
Simple example
--------------
Find the shortest path between two nodes in an undirected graph:
.. code:: pycon
>>> 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']
Install
-------
Install the latest version of NetworkX::
$ pip install networkx
Install with all optional dependencies::
$ pip install networkx[all]
For additional details, please see `INSTALL.rst`.
Bugs
----
Please report any bugs that you find `here <https://github.com/networkx/networkx/issues>`_.
Or, even better, fork the repository on `GitHub <https://github.com/networkx/networkx>`_
and create a pull request (PR). We welcome all changes, big or small, and we
will help you make the PR if you are new to `git` (just ask on the issue and/or
see `CONTRIBUTING.rst`).
License
-------
Released under the 3-Clause BSD license (see `LICENSE.txt`)::
Copyright (C) 2004-2023 NetworkX Developers
Aric Hagberg <hagberg@lanl.gov>
Dan Schult <dschult@colgate.edu>
Pieter Swart <swart@lanl.gov>

File diff suppressed because it is too large Load Diff

View File

@@ -0,0 +1,5 @@
Wheel-Version: 1.0
Generator: bdist_wheel (0.40.0)
Root-Is-Purelib: true
Tag: py3-none-any

View File

@@ -0,0 +1,2 @@
[networkx.plugins]
nx-loopback = networkx.classes.tests.dispatch_interface:dispatcher

View File

@@ -0,0 +1 @@
networkx