Commit 7bcb3dac authored by Roman Yurchak's avatar Roman Yurchak Committed by GitHub

Merge pull request #271 from darthtrevino/feature/add_networkx_package

Add NetworkX Package
parents 7710c2a3 e6fe7022
package:
name: decorator
version: 4.3.0
source:
url: https://files.pythonhosted.org/packages/6f/24/15a229626c775aae5806312f6bf1e2a73785be3402c0acdec5dbddd8c11e/decorator-4.3.0.tar.gz
sha256: c39efa13fbdeb4506c476c9b3babf6a718da943dab7811c206005a4a956c080c
test:
imports:
- decorator
\ No newline at end of file
package:
name: networkx
version: '2.2'
source:
url: https://files.pythonhosted.org/packages/f3/f4/7e20ef40b118478191cec0b58c3192f822cace858c19505c7670961b76b2/networkx-2.2.zip
sha256: 45e56f7ab6fe81652fb4bc9f44faddb0e9025f469f602df14e3b2551c2ea5c8b
requirements:
run:
- decorator
- setuptools
test:
imports:
- networkx
- networkx.algorithms
- networkx.algorithms.approximation
- networkx.algorithms.assortativity
- networkx.algorithms.bipartite
- networkx.algorithms.centrality
- networkx.algorithms.chordal
- networkx.algorithms.coloring
- networkx.algorithms.community
- networkx.algorithms.components
- networkx.algorithms.connectivity
- networkx.algorithms.flow
- networkx.algorithms.isomorphism
- networkx.algorithms.link_analysis
- networkx.algorithms.node_classification
- networkx.algorithms.operators
- networkx.algorithms.shortest_paths
- networkx.algorithms.traversal
- networkx.algorithms.tree
- networkx.classes
- networkx.drawing
- networkx.generators
- networkx.linalg
- networkx.readwrite
- networkx.readwrite.json_graph
- networkx.utils
\ No newline at end of file
def test_networkx_basicgraph(selenium_standalone, request):
selenium = selenium_standalone
selenium.load_package(['networkx'])
cmd = """
import networkx as nx
G = nx.Graph()
G.add_nodes_from([1,2,3])
G.add_edges_from([(1,2), (1,3)])
assert G.number_of_nodes() == 3
assert G.number_of_edges() == 2
"""
selenium.run(cmd)
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment