graphflux 3.4.1

Python package for creating and manipulating graphs and networks

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:

>>> 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. Or, even better, fork the repository on GitHub 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 <[e-mail]>