Statistics
| Branch: | Revision:

## iof-tools / networkxMiCe / networkx-master / networkx / algorithms / bipartite / tests / test_redundancy.py @ 5cef0f13

 1 ```# test_redundancy.py - unit tests for the bipartite.redundancy module ``` ```# ``` ```# Copyright 2015 Jeffrey Finkelstein . ``` ```# ``` ```# This file is part of NetworkX. ``` ```# ``` ```# NetworkX is distributed under a BSD license; see LICENSE.txt for more ``` ```# information. ``` ```"""Unit tests for the :mod:`networkx.algorithms.bipartite.redundancy` module. ``` ``` ``` ```""" ``` ```from __future__ import division ``` ```from nose.tools import assert_equal ``` ```from nose.tools import assert_true ``` ```from nose.tools import raises ``` ```from networkx import cycle_graph ``` ```from networkx import NetworkXError ``` ```from networkx.algorithms.bipartite import complete_bipartite_graph ``` ```from networkx.algorithms.bipartite import node_redundancy ``` ```def test_no_redundant_nodes(): ``` ``` G = complete_bipartite_graph(2, 2) ``` ``` rc = node_redundancy(G) ``` ``` assert_true(all(redundancy == 1 for redundancy in rc.values())) ``` ```def test_redundant_nodes(): ``` ``` G = cycle_graph(6) ``` ``` edge = {0, 3} ``` ``` G.add_edge(*edge) ``` ``` redundancy = node_redundancy(G) ``` ``` for v in edge: ``` ``` assert_equal(redundancy[v], 2 / 3) ``` ``` for v in set(G) - edge: ``` ``` assert_equal(redundancy[v], 1) ``` ```@raises(NetworkXError) ``` ```def test_not_enough_neighbors(): ``` ``` G = complete_bipartite_graph(1, 2) ``` ``` node_redundancy(G) ```