48

GitHub - networkx/networkx: Official NetworkX source code repository.

 4 years ago
source link: https://github.com/networkx/networkx
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.

README.rst

NetworkX

https://travis-ci.org/networkx/networkx.svg?branch=master https://ci.appveyor.com/api/projects/status/github/networkx/networkx?branch=master&svg=true 68747470733a2f2f636f6465636f762e696f2f67682f6e6574776f726b782f6e6574776f726b782f6272616e63682f6d61737465722f67726170682f62616467652e737667

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

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.

Simple example

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

>>> 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']

Bugs

Please report any bugs that 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-2019 NetworkX Developers
Aric Hagberg <[email protected]>
Dan Schult <[email protected]>
Pieter Swart <[email protected]>

About Joyk


Aggregate valuable and interesting links.
Joyk means Joy of geeK