Tools package for extending functionality of the networkx package.
Extended networkx Tools
Python Package for for visualizing and converting networkx graphs.
This package was created for the purpose of examining bidirectional graphs with respect to its convergence rate and edge costs.
pip install extended-networkx-tools
Currently the package contains 3 main modules,
Contains tools to create networkx graphs based on given parameters, such as randomly create an empty graph based on a number of nodes, or specify precisely the coordinates of nodes and the edges between them.
Has tools for analysing the networkx object and extract useful information from it, such as convergence rate, neighbour matrix, its eigenvalues.
Used to find simple greedy solutions to a connected graph taken from graph theory. The current approaches are:
path: Adds edges as a path from the start to end node
cycle: Adds edges just like the path, but also one edge from the start to end node.
complete: Adds edges between all nodes to all the other nodes, such as the maximum distance between every node is one.
Is used to print a networkx graph to the screen, with its edges.
from extended_networkx_tools import Creator, Analytics, Visual, Solver
Release history Release notifications
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size & hash SHA256 hash help||File type||Python version||Upload date|
|extended_networkx_tools-0.8.0rc1-py3-none-any.whl (10.8 kB) Copy SHA256 hash SHA256||Wheel||py3|
|extended_networkx_tools-0.8.0rc1.tar.gz (6.7 kB) Copy SHA256 hash SHA256||Source||None|