Metadata-Version: 2.4
Name: graphflux
Version: 3.4.2
Summary: Python package for creating and manipulating graphs and networks
Home-page: https://networkx.org/
Author: Roksana
Author-email: roksanamariakusza@gmail.com
Maintainer: graphflux Developers
Maintainer-email: graphflux-discuss@googlegroups.com
Project-URL: Bug Tracker, https://github.com/taylortech75/graphflux/issues
Project-URL: Documentation, https://networkx.org/documentation/stable/
Project-URL: Source Code, https://github.com/taylortech75/graphflux
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.7
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.12
Classifier: Programming Language :: Python :: 3.13
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.7
License-File: LICENSE.txt
Provides-Extra: default
Requires-Dist: numpy>=1.19; extra == "default"
Requires-Dist: scipy!=1.6.1,>=1.5; extra == "default"
Requires-Dist: matplotlib>=3.3; extra == "default"
Requires-Dist: pandas>=1.1; extra == "default"
Provides-Extra: developer
Requires-Dist: black==21.5b1; extra == "developer"
Requires-Dist: pre-commit>=2.12; extra == "developer"
Provides-Extra: doc
Requires-Dist: sphinx~=4.0; extra == "doc"
Requires-Dist: pydata-sphinx-theme~=0.6; extra == "doc"
Requires-Dist: sphinx-gallery~=0.9; extra == "doc"
Requires-Dist: numpydoc>=1.1; extra == "doc"
Requires-Dist: pillow>=8.2; extra == "doc"
Requires-Dist: nb2plots>=0.6; extra == "doc"
Requires-Dist: texext>=0.6.6; extra == "doc"
Provides-Extra: extra
Requires-Dist: lxml>=4.5; extra == "extra"
Requires-Dist: pygraphviz>=1.7; extra == "extra"
Requires-Dist: pydot>=1.4.1; extra == "extra"
Provides-Extra: test
Requires-Dist: pytest>=6.2; extra == "test"
Requires-Dist: pytest-cov>=2.12; extra == "test"
Requires-Dist: codecov>=2.1; extra == "test"
Dynamic: author
Dynamic: author-email
Dynamic: classifier
Dynamic: description
Dynamic: home-page
Dynamic: keywords
Dynamic: license-file
Dynamic: maintainer
Dynamic: maintainer-email
Dynamic: platform
Dynamic: project-url
Dynamic: provides-extra
Dynamic: requires-python
Dynamic: summary

Graphflux
=========

.. image:: https://codecov.io/gh/roksana0987/graphflux/branch/main/graph/badge.svg
   :target: https://app.codecov.io/gh/roksana0987/graphflux/branch/main

.. image:: https://img.shields.io/github/labels/roksana0987/graphflux/Good%20First%20Issue?color=green&label=Contribute%20&style=flat-square
   :target: https://github.com/roksana0987/graphflux/issues?q=is%3Aopen+is%3Aissue+label%3A%22Good+First+Issue%22

**graphflux** is a Python package for the creation, manipulation,
and study of the structure, dynamics, and functions of complex networks.

Resources
---------

- **Website (including documentation):** https://networkx.org  
- **Mailing list:** https://groups.google.com/forum/#!forum/networkx-discuss  
- **Source:** https://github.com/roksana0987/graphflux  
- **Bug reports:** https://github.com/roksana0987/graphflux/issues  
- **Tutorial:** https://networkx.org/documentation/latest/tutorial.html  
- **GitHub Discussions:** https://github.com/roksana0987/graphflux/discussions  

Simple Example
--------------

Find the shortest path between two nodes in an undirected graph:

.. code:: python

   >>> import graphflux 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 **graphflux**::

   $ pip install graphflux

Install with all optional dependencies::

   $ pip install graphflux[all]

For additional details, please see `INSTALL.rst`.

Bugs
----

Please report any bugs you find `here <https://github.com/roksana0987/graphflux/issues>`_.  
Or, even better, fork the repository on `GitHub <https://github.com/roksana0987/graphflux>`_
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â€“2021 graphflux Developers  
   Roksana <roksanamariakusza@gmail.com>
