Metadata-Version: 2.1
Name: networkz
Version: 1.0.3
Summary: Extended Graph-Algorithms Library on Top of NetworkX
Home-page: https://github.com/ariel-research/networky
Author: Ariel University
Author-email: networky@csariel.xyz
Project-URL: Bug Reports, https://github.com/ariel-research/networky/issues
Project-URL: Source Code, https://github.com/ariel-research/networky
Description-Content-Type: text/markdown
Requires-Dist: networkx

# NetworkY

NetworkY is a library of graph algorithms in Python. It is an extension of the [NetworkX](https://github.com/networkx/networkx). It contains (by import) everything that is in NetworkX, plus some additional algorithms that were submitted into NetworkX but not merged yet. Currently, NetworkY contains the following additional algorithms:

* [Rank-maximal matching](networky/algorithms/bipartite/rank_maximal_matching.py)
* [Approximate coalition formation](networky/algorithms/approximation/coalition_formation.py)

New additions are welcome!
